Workshop III: Topics in Graphs and Hypergraphs

November 2 - 6, 2009

Schedule


Monday, November 2, 2009

9:00 - 9:50
Dhruv Mubayi (University of Illinois at Chicago)

Coloring Simple Hypergraphs

10:15 - 11:05
Peter Keevash (Queen Mary, University of London)

Shadows and intersections: stability and new proofs

11:30 - 12:20
2:30 - 3:20
Endre Szemeredi (Rutgers University)

Spanning Trees in Dense Graphs

4:00 - 4:50
David Conlon (University of Cambridge)

Combinatorial theorems relative to a random set


Tuesday, November 3, 2009

9:00 - 9:50
10:15 - 11:05
Penny Haxell (University of Waterloo)

Packing and covering in hypergraphs

11:30 - 12:20
Po-Shen Loh (Princeton University)

Maximizing the number of colorings

2:30 - 3:20
4:00 - 4:50
Asaf Shapira (Georgia Institute of Technology)

Color-Critical Graphs Have Logarithmic Circumference


Wednesday, November 4, 2009

9:00 - 9:50
Jarik Nesetril (Charles University, Prague)

Existence and Counting

10:15 - 11:05
Vera Sos (Renyi Institute of Mathematics)

Convergence and limits of graph sequences

11:30 - 12:20
Alexander Kostochka (University of Illinois at Urbana-Champaign)

Coloring and equitable coloring of graphs with restrictions on degrees of vertices and edges

2:30 - 3:20
Tibor Szabo (Freie Universität Berlin)

On the minimum degree of minimal Ramsey graphs

4:00 - 4:50
Oleg Pikhurko (Carnegie-Mellon University)

Minimum Saturated Graphs and Hypergraphs


Thursday, November 5, 2009

9:00 - 9:50
Miklos Simonovits (Renyi Institute of Mathematics)

Stability methods and extremal graph theory

10:15 - 11:05
Zoltan Furedi (University of Illinois at Urbana-Champaign)

Unavoidable subhypergraphs: a-clusters Applications of the delta system method

11:30 - 12:20
Jacques Verstraete (University of California, San Diego (UCSD))

Extremal problems for cycles in graphs

2:30 - 3:20
Gabor Tardos (Simon Fraser University)

Limits of trees

4:00 - 4:50
Ervin Gyori (Renyi Institute of Mathematics)

Graph and Hypergraph Extremal Problems Related to Cycles


Friday, November 6, 2009

9:00 - 9:50
Tomasz Luczak (Adam Mickiewicz University)

On the structure of H-free dense graphs

10:15 - 11:05
Imre Leader (University of Cambridge)

Absolute Values of Sumsets

11:30 - 12:20
Stephan Thomasse (Université des Sciences et Techniques de Languedoc (USTL) (Montpellier II))

Partitioning a graph into a cycle and an anticycle Joint work with St\'ephan Bessy