27. Probabilistic and Extremal Combinatorics

18.09.2014 (Thursday)

TimeTitleLecturer
14:30-14:55The condensation phase transition in random graph coloringAmin Coja-Oghlan
15:00-15:25Improved algorithms for colorings of simple hypergraphsJakub Kozik
15:30-15:55Distributed algorithms and random graphsKatarzyna Rybarczyk
16:00-16:25Chromatic thresholds in random graphsJulia Böttcher
16:30-17:00Coffee
17:00-17:25Counting $H$-free graphsWojciech Samotij
17:30-17:55Waiter-Client $H$-gamesMałgorzata Bednarska-Bzdęga
18:00-18:25On digital tree structures under Markov SourcesRalph Neininger
18:30-18:55Graph limits via discrete potential theoryRudolf Grübel

19.09.2014 (Friday)

TimeTitleLecturer
14:30-14:55Ramsey theorems for random structuresAngelika Steger
15:00-15:25On the size-Ramsey numbers of graphs and hypergraphsAndrzej Dudek
15:30-15:55Harmonious Coloring of HypergraphsBartłomiej Bosek
16:00-16:25Irregularity in graphsJakub Przybyło
16:30-17:00Coffee
17:00-17:25Hamilton saturated hypergraphs of essentially minimum sizeAndrzej Żak
17:30-17:55Embedding in sparse graphsPeter Allen
18:00-18:25The Inducibility of short directed CyclesFlorian Pfender
18:30-18:55Cycles in triangle-free graphs of large chromatic numberBenny Sudakov