Schema för möte 2, 21/10

---

Obs! Tiderna är ungefärliga!

16.00-16.15 Samling/fika i fikarummet plan 4 (bottenvåningen) Matematiska institutionen,
Lindstedtsvägen 15 (precis under 21 på kartan), KTH. T-bana: Tekniska högskolan.

16.20-17.20 - Integraler

• - Tomas Ekholm: Kontinuitet

17.30-18.00 Föredrag:

• - Federico Incitti: Counting trees

A famous theorem due to Cayley says that the number of unlabelled trees on n vertices is n^(n-2). A simple proof of this fact is given, showing that there is a bijection between such trees and the sequences of length n-2 of integers between 1 and n. This bijection is known as Prufer coding.