See also detailed program
Monday (5.08)
9:00-9:05 | Opening ceremony |
9:05-10:00 | Béla Bollobás Bootstrap percolation -- critical probability and speed |
10:00-10:30 | coffee break |
10:30-11:10 | Alan Frieze The cover time of random walks on random graphs |
11:15-11:55 | Svante Janson An epidemic on a random graph with given vertex degrees |
12:00-12:40 | Geoffrey Grimmett Counting self-avoiding walks |
12:45 | Conference Photo |
13:00-14:00 | lunch |
14:30-15:10 | Gyula O. H. Katona Some recent results |
15:15-15:55 | Jaroslav Nešetřil Orderings and orientations of sparse graphs |
16:00-16:30 | coffee break |
16:30-17:10 | Vera Sós Induced subgraphs and Ramsey colorings |
17:15-17:55 | Joel Spencer From Erdős to Algorithms |
18:15 | Welcoming Reception |
Tuesday (6.08)
9:05-10:00 | Mathias Schacht Extremal results in random graphs |
||||
10:00-10:30 | coffee break | ||||
A | B | C | D | E | |
10:30-10:55 | Julia Boettcher | Tobias Muller | Oliver Cooley | Małgorzata Sulkowska | Rani Hod |
11:00-11:25 | Peter Allen | Dieter Mitsche | Christoph Koch | Małgorzata Kuchta | Rajko Nenadov |
11:30-11:55 | Humberto Naves | Valentas Kurauskas | Stephen Young | John Lapinskas | Asaf Ferber |
12:00-12:25 | Andrzej Dudek | Richard Montgomery | Tamás Makai | Peter Heinig | Andrew Beveridge |
12:30-12:55 | Bartosz Zaleski | Rob Morris | Michel Bode | Dan Hefetz | Gal Kronenberg |
13:00-14:00 | lunch | ||||
14:30-15:00 | Graham Brightwell A differential equation method with applications to routing models I |
||||
15:00-15:30 | Malwina Luczak A differential equation method with applications to routing models II |
||||
15:30-16:00 | Nick Wormald A new model for analysis of the random graph d-process |
||||
16:00-16:30 | coffee break | ||||
16:30-17:00 | József Balogh Phase transitions in Ramsey-Turan Theory |
||||
17:00-17:30 | Colin Cooper The height of random $k$-trees and related branching processes |
||||
17:30-18:00 | Gregory Sorkin The Satisfiability Threshold for k-XORSAT |
Wednesday (7.08)
9:05-10:00 | Gil Kalai Influences, thresholds, and tribes |
||||
10:00-10:30 | coffee break | ||||
A | B | C | D | E | |
10:30-10:55 | Richard Mycroft | Paul Russell | Nikolaos Fountoulakis | Cecilia Holmgren | Lale Ozkahya |
11:00-11:25 | Anand Srivastav | Hiệp Hàn | Andrew Uzzell | Kevin Leckey | Kinga Dąbrowska |
11:30-11:55 | Cyril Banderier | Wenying Gan | Michał Przykucki | Liudmila Ostroumova | Halina Bielak |
12:00-12:25 | Uwe Roesler | Shagnik Das | Paul Smith | John Haslegrave | Sebastian Kieliszek |
12:30-12:55 | Krzysztof Krzywdziński | Jan Volec | Julia Ehrenmüller | Kamil Powroźnik | |
13:00-14:00 | lunch | ||||
excursion + Random Run |
Thursday (8.08)
9:05-10:00 | Michael Krivelevich Random subgraphs of large minimum degree graphs |
||||
10:00-10:30 | coffee break | ||||
A | B | C | D | E | |
10:30-10:55 | Po-Shen Loh | Pawel Prałat | Roman Glebov | Thomas Vallier | Andreas Noever |
11:00-11:25 | Paweł Hitczenko | Dominik Vu | Xavier Pérez-Giménez | Daniel Štefankovič | Mikhail Lavrov |
11:30-11:55 | Ljuben Mutafchiev | Will Perkins | Alon Naor | Ivona Bezáková | Andrei Raigorodskii |
12:00-12:25 | Eugenijus Manstavičius | Maksim Zhukovskii | Andrew McDowell | Charilaos Efthymiou | Ross Kang |
12:30-12:55 | Piotr Śniady | Svetlana Popova | Jie Ma | Mario Ullrich | |
13:00-14:00 | lunch | ||||
14:30-15:00 | Aravind Srinivasan Extensions and New Constructive Versions of the Lovasz Local Lemma |
||||
15:00-15:30 | Daniel Král Finitely forcible graphons and permutons |
||||
15:30-16:00 | Jacob Fox A relative Szemeredi theorem |
||||
16:00-16:30 | coffee | ||||
16:30-17:00 | Benny Sudakov Cores of random graphs are born Hamiltonian |
||||
17:00-17:30 | Stefanie Gerke Controllability and matchings in random bipartite graphs with a fixed degree distribution |
||||
17:30-18:00 | David Conlon Almost-spanning universality in random graphs |
||||
19:30 | Banquet |
Friday (9.08)
9:05-10:00 | Oleg Pikhurko Flag Algebra Method in Extremal Combinatorics |
||||
10:00-10:30 | coffee break | ||||
A | B | C | D | E | |
10:30-10:55 | Wojciech Samotij | Mark Walters | Dmitry Shabanov | Daniel Reichman | Mindaugas Bloznelis |
11:00-11:25 | Angelica Pachon Pinzon | Lutz Warnke | Andrey Kupavskii | Urszula Romańczuk | Katarzyna Rybarczyk |
11:30-11:55 | Guillem Perarnau | Ali Pourmiri | Jakub Przybyło | Monika Polak | Victor Falgas-Ravry |
12:00-12:25 | Abbas Mehrabian | Lajos Vágó | Pu Gao | Katherine Staden | David Penman |
12:30-12:55 | István Kolossváry | Cristiane Sato | Fiona Skerman | ||
13:00-14:00 | lunch | ||||
14:00-14:30 | Mihyun Kang Chasing the Giant Component in Random Graph Processes |
||||
14:30-15:30 | Noga Alon The cover number of a matrix and its applications |
||||
THE END |