Extremal and Probabilistic Combinatorics

Day

Time

Room Number   Name

5-Jun

8:30 AM

236

Marcos Kiwi*
Martin Loebl

Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs

9:00 AM

Reto Spöhel*
Martin Marciniszyn
Angelika Steger

Online Ramsey Games in Random Graphs

9:30 AM

Tibor Szabó*
Dan Hefetz
Michael Krivelevich
Milos Stojakovic

On the rules of avoiding

10:00 AM

Block 2

Ralph J. Faudree

Recent Results on Saturated Graphs

6-Jun

8:30 AM

Aud 2

Ronald J. Gould*
Ralph J. Faudree
Michael S. Jacobson
Colton Magnant

Distributing Vertices on Hamiltonian Cycles

9:00 AM

Jayme L. Szwarcfiter*
Min Chih Lin

Unit circular-arc graph representations and feasible circulations

9:30 AM

József Balogh*
Noga Alon
Alexandr V Kostochka
Wojtek Samotij

The number of induced subgraphs with distinct size or order

10:00 AM

Block 3

Bruce Reed

The Diameter of a random graph

6-Jun

1:30 PM

Aud 2

Tom A. Bohman

Hamilton Cycles in Sparse Random Graphs

2:00 PM

O. Riordan

Clique percolation

2:30 PM

Roberto Imbuzeiro Oliveira

The interchange process has the same spectral gap as the underlying random walk

3:00 PM

Block 4

Gábor N. Sárközy

Cycles in hypergraphs

7-Jun

9:30 AM

Aud 2

Dhruv Mubayi*
Tom Bohman
Alan Frieze

Coloring H-free hypergraphs

10:00 AM

Manoel J M S Lemos

Non-separating cocircuits in binary matroids

10:30 AM

Gabor Kun

The asymptotical version of the Bollobas-Catlin-Eldridge conjecture

11:00 AM

Block 5

Balázs Szegedy*
Laszlo Lovasz

Forcing Randomness and Structure in Graphs

7-Jun

2:30 PM

Aud 2

Gábor Elek

Regularity theorems for graphs of bounded degree

3:00 PM

Endre Szemerédi*
Miklos Ajtai
Janos Komlos
Miklos Simonovits

Asymptotic solution of the Erdös-T. Sós conjecture

3:30 PM

Miklós Simonovits*
Miklos Ajtai
Janos Komlos
Endre Szemeredi

The exact solution of the Erdös-T. Sós conjecture

4:00 PM