| Übersicht | Schedule |
January 30, 2012
09:00-09:40 Probability makes counting (sometimes) easy (Qiaochu Li)
09:45-10:25 How to guard a museum (Viktoria Wasmayr)
10:30-11:10 Turáns graph theorem (Marcel Weber)
11:30-12:10 Lines in the plane and decompositions of graphs (Ji-Young Kang)
12:15-12:55 Three applications of Eulers formula (Dominik Knebel)
February 13, 2012
09:00-09:40 Six proofs of the infinity of primes (Harneet Singh Roopra)
09:45-10:25 Bertrands postulate (Tara Selina Nowak)
10:45-11:25 Buffons needle problem (Katharina Brunning)
11:30-12:10 Five-coloring plane graphs (Mekong Lam)
13:00-13:40 Of friends and politicians (Stefan Lüttgen)
13:45-14:25 Pigeon-hole and double counting (Susanne Rieß)
14:45-15:25 Three famous theorems on finite sets (Tugba Akman)
15:30-16:10 Shuffling cards (Lena Pfifferling)