The 14th International Conference on

Poznan, August 3-7, 2009
back to the main page


Although the schedule is now complete, it is still subject to last minute changes.


Monday Tuesday Wednesday Thursday Friday
Kannan Sudakov Hefetz Linial Stark Samotij
Grytczuk Holmgren Penman
  Panagiotou Heinig
Bohman Szabó Doerr Conlon Ben-Shimon Hladky
Luczak Böttcher Volec
Janson Balogh Schmeling Stojaković Perez-Gimenez Piguet
Wormald Král Beveridge Brightwell Markström
Nešetřil MullerBen-Eliezer Thomas Huber E
Szemerédi HaberBukh Loh Panholzer Kun
Duffus RybarczykGebauer Spöhel Dudek Pikhurko
Ruciński SeierstadWastlund Mütze Pegden Kang
Schacht ChristofidesDe Sterck Wolfovitz Patkós Riordan
  PersonGao Fountoulakis Walczak
Birthday PartyRandom RunFarewell party

Detailed schedule

Monday (3.08)

08:59 Opening Address
9:00-10:00Ravi Kannan
A new probability inequality and concentration results
10:00-10:30 coffee
10:30-11:30 Tom Bohman
The H-free Process
11:45-12:15 Svante Janson
Random threshold graphs and threshold graph limits
12:15-12:45 Nick Wormald
On the chromatic number of random $d$-regular graphs
13:00-14:00 lunch
15:00-15:30 Jaroslav Nešetřil
Just a few memories
15:30-16:00 Endre Szemerédi
My friend Vojta
16:00-16:30 Dwight Duffus
Twenty Years of Mathematics and Life with Professor Rödl
16:30-17:00 coffee
17:00-17:30 Andrzej Ruciński
My journeys with Vojta
17.30-18.00Mathias Schacht
Weakly quasirandom hypergraphs


Tuesday (4.08)

9:00-10:00 Benny Sudakov
Hypergraph Ramsey problem
10:00-10:30 coffee
10:30-11:30 Tibor Szabó
Positional games and random graphs
11:45-12:15 Jozsef Balogh
Hamiltonicity of random geometric graphs (abstract)
12:15-12:45Daniel Král
Removal Lemma for systems of linear equations (abstract)
13:00-14:00 lunch
Conference room 1Conference room 2
14:30-14:55 Tobias Muller
More results on Hamilton cycles in random geometric graphs (abstract)
Ido Ben-Eliezer
Random low degree polynomials are hard to approximate (abstract)
15:00-15:25 Simi Haber
The Logic of Random Regular Graphs (abstract)
Boris Bukh
Lower bounds on weak epsilon-net (abstract)
15:30-15:55 Katarzyna Rybarczyk
Equivalence of Random Intersection Graph and G(n,p) for \alpha\le 6 (abstact)
Heidi Gebauer
The Lovasz Local Lemma is tight for SAT (abstract)
16:00-16:30 coffee
16:30-16:55 Taral Seierstad
A central limit theorem using the differential equation method
Johan Wastlund
Combinatorial optimization and replica
17:00-17:25 Demetres Christofides
Chromatic numbers for random Cayley graphs
Hans De Sterck
Fast multilevel numerical methods for random walks on directed graphs (abstract)
17:30-17:55 Yury Person
Extremal edge coloring problems (abstract)
Jane Gao
Probabilities of large induced subgraphs of random regular graphs
19:00 dinner


Wednesday (5.08)

9:00-9:30Dan Hefetz
Playing to retain the advantage (abstract)
9:30-10:00 Jarosław Grytczuk
Thue games
10:00-10:30 coffee
10:30-11:00 Benjamin Doerr
Quasi-random rumor spreading (abstract)
11:00-11:30Malwina Luczak
Averaging over fast variables in the fluid limit for Markov chains (abstract)
11:45-12:15Tatiana Schmeling
Inhomogeneous Random Graphs at Criticality (diffusion approximation for the sizes of components)
12:15-12:45Andrew Beveridge
Exit frequency matrices for finite Markov chains (abstract)
13:00-14:00 lunch
Conference room 1Conference room 2
14:30-14:55Henning Thomas
Coloring the edges of a random graph without monochromatic giant (abstract)
Anna Huber
Quasirandom rumour spreading on the complete graph (abstract)
15:00-15:25Po-Shen Loh
Ramsey games with giants (abstract)
Alois Panholzer
Analysis of label-dependent parameters in increasing trees (abstract)
15:30-15:55 Reto Spöhel
Offline thresholds for online games (abstract)
Andrzej Dudek
On K_s-free subgraphs in K_s+k-free graphs (abstract)
16:00-16:30 coffee
16:30-16:55Torsten Mütze
Avoiding small subgraphs in the Achlioptas process (abstract)
Wesley Pegden
Highly nonrepetitive sequences: winning strategies from the Local Lemma (abstract)
17:00-17:25 Guy Wolfovitz
Triangle-free subgraphs at the triangle-free process (abstract)
Balazs Patkós
On randomly generated non-trivially intersecting hypergraphs (abstract)
17:30-17:55Nikolaos Fountoulakis
3-connected cores in random 2-connected graphs (abstract)
Bartosz Walczak
Graph eating game (abstract)


Thursday (6.08)

9:00-10:00Nati Linial
Going up in dimension: Combinatorial and Probabilistic Aspects of Simplicial Complexes
10:00-10:30 coffee
10:30-11:30 David Conlon
Combinatorial theorems in random sets
11:45-12:15 Milos Stojaković
Strange behavior of Avoide and Enforcer (abstract)
12:15-12:45 Graham Brightwell
Random partial orders and random linear extensions (abstract)
13:00-14:00 lunch


Friday (7.08)

Conference room 1Conference room 2
9:00-9:25Dudley Stark
The edge correlation of random forests
Wojciech Samotij
Counting graphs without a fixed subgraph (abstract)
9:30-9:55Cecilia Holmgren
Novel Characteristics of Split Trees by use of Renewal Theory (abstract)
David Penman
Chromatic numbers of some pseudo-random graphs
10:00-10:25Konstantinos Panagiotou
Vertices of Degree k in Random Maps
Peter Heinig
Half of the minimum degree suffices for a bipartite graph to contain spanning subgraphs of low bandwidth (abstract)
11:00-11:25Sonny Ben-Shimon
On the Local Resilience of Random Regular Graphs (abstract)
Jan Hladky
Counting flags in triangle-free digraphs (abstract)
11:30-11:55Julia Böttcher
Local resilience of random graphs with respect to universality for almost spanning subgraphs (abstract)
Jan Volec
Domination number of cubic graphs with large girth (abstract)
12:00-12:25Xavier Perez-Gimenez
Asymptotic enumeration of sparse strongly connected digraphs
Diana Piguet
Tripartite Ramsey number for trees (abstract)
12:30-13:30 lunch
14:00-14:30 Klas Markström
A general homomorphism polynomial and sparse/dense symmetries of constraint problem on random graphs (abstract)
14:30-15:00Cyril Banderier
Average Case Analysis of NP-complete Problems: Maximum Independent Set and Exhaustive Search Algorithms (abstract)
15:00-15:30Gabor Kun
On the asymptotical version of the Bollobas-Catlin-Eldridge conjecture (abstract)
15:30-16:00Oleg Pikhurko
Finding an Unknown Acyclic Orientation of a Given Graph
16:30-17:00 Mihyun Kang
Random graphs on surfaces
17:00-18:00Oliver Riordan
The diameter of G(n.p)