Workshop III: Topics in Graphs and Hypergraphs - IPAM

Workshop III: Topics in Graphs and Hypergraphs

Part of the Long Program Combinatorics: Methods and Applications in Mathematics and Computer Science
November 2 - 6, 2009

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, November 2, 2009

Morning Session

08:00-08:50
Check-In/Light Breakfast (Hosted by IPAM)
08:50-09:00
Welcome and Opening Remarks
09:00-9:50
Dhruv Mubayi (University of Illinois at Chicago)
Coloring Simple Hypergraphs
10:00-10:15
Break
10:15-11:05
Peter Keevash (Queen Mary, University of London)
Shadows and intersections: stability and new proofs
11:15-11:30
Break
11:30-12:20
Maria Chudnovsky (Columbia University)
Large cliques and stable sets in graphs with no 4-edge paths or 5-edge antipaths

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Endre Szemeredi (Rutgers University)
Spanning Trees in Dense Graphs
15:30-16:00
Break
16:00-16:50
David Conlon (University of Cambridge)
Combinatorial theorems relative to a random set
17:00-18:30
Reception and Poster Session (Hosted by IPAM)

Tuesday, November 3, 2009

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:50
Paul Seymour (Princeton University)
Tournament immersion and Rao's degree-sequence conjecture
10:00-10:15
Coffee Break
10:15-11:05
Penny Haxell (University of Waterloo)
Packing and covering in hypergraphs
11:15-11:30
Break
11:30-12:20
Po-Shen Loh (Princeton University)
Maximizing the number of colorings

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Bojan Mohar (Simon Fraser University)
Chromatic number and complete graph substructures for degree sequences
15:30-16:00
Break
16:00-16:50
Asaf Shapira (Georgia Institute of Technology)
Color-Critical Graphs Have Logarithmic Circumference

Wednesday, November 4, 2009

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:50
Jarik Nesetril (Charles University, Prague)
Existence and Counting
10:00-10:15
Coffee Break
10:15-11:05
Vera Sos (Renyi Institute of Mathematics)
Convergence and limits of graph sequences
11:15-11:30
Break
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

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Tibor Szabo (Freie Universität Berlin)
On the minimum degree of minimal Ramsey graphs
15:30-16:00
Break
16:00-16:50
Oleg Pikhurko (Carnegie-Mellon University)
Minimum Saturated Graphs and Hypergraphs

Thursday, November 5, 2009

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:50
Miklos Simonovits (Renyi Institute of Mathematics)
Stability methods and extremal graph theory
10:00-10:15
Coffee Break
10:15-11:05
Zoltan Furedi (Renyi Institute of Mathematics)
Unavoidable subhypergraphs: a-clusters Applications of the delta system method
11:15-11:30
Break
11:30-12:20
Jacques Verstraete (University of California, San Diego (UCSD))
Extremal problems for cycles in graphs

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Gabor Tardos (Renyi Institute of Mathematics)
Limits of trees
15:30-16:00
Break
16:00-16:50
Ervin Gyori (Renyi Institute of Mathematics)
Graph and Hypergraph Extremal Problems Related to Cycles
Printable Version