Combinatorics Tutorials - IPAM

Combinatorics Tutorials

Part of the Long Program Combinatorics: Methods and Applications in Mathematics and Computer Science
September 9 - 16, 2009

Schedule

All times in this Schedule are Pacific Time (PT)

Wednesday, September 9, 2009

Morning Session

08:30-09:15
Check-In/Light Breakfast (Hosted by IPAM)
09:15-09:30
Welcome and Opening Remarks
09:30-10:30
Igor Pak (University of California, Los Angeles (UCLA))
Tree bijections
10:30-11:00
Break
11:00-12:00
Robin Thomas (Georgia Institute of Technology)
The circumference of color-critical graphs

Afternoon Session

12:00-12:30
Core Orientation with IPAM Staff
12:30-14:00
Lunch (on your own)
14:00-15:00
Jacob Fox (Princeton University)
Geometric graphs
15:00-15:30
Break
15:30-16:30
Angelika Steger (ETH Zürich)
The Regularity Lemma

Friday, September 11, 2009

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:30
Igor Pak (University of California, Los Angeles (UCLA))
Young tableaux bijections
10:30-11:00
Break
11:00-12:00
Robin Thomas (Georgia Institute of Technology)
Three-coloring triangle-free graphs on surfaces

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-15:00
Angelika Steger (ETH Zürich)
The Sparse Regularity Lemma
15:00-15:30
Break
15:30-16:30
Jacob Fox (Princeton University)
Geometric intersection graphs and partially ordered sets

Monday, September 14, 2009

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:30
Penny Haxell (University of Waterloo)
Sperner's Lemma, Scarf's Lemma and applications in combinatorics
10:30-11:00
Break
11:00-12:00
Nathan (Nati) Linial (Hebrew University)
Expander graphs and their applications

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-15:00
Benjamin Sudakov (University of California, Los Angeles (UCLA))
Turan theorem: generalizations and applications
15:00-15:30
Break
15:30-16:30
Jozsef Solymosi (University of British Columbia)
Sum-Product problems over various fields

Tuesday, September 15, 2009

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:30
Penny Haxell (University of Waterloo)
Sperner's Lemma, Scarf's Lemma and applications in combinatorics
10:30-11:00
Break
11:00-12:00
Jozsef Solymosi (University of British Columbia)
Schur's Theorem, Van der Waerden's Theorem and the Hales-Jewett Theorem

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-15:00
Nathan (Nati) Linial (Hebrew University)
Expander graphs and their applications
15:00-15:30
Break
15:30-16:30
Peter Keevash (Queen Mary, University of London)
Hypergraph Tur\'an Problems

Wednesday, September 16, 2009

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:30
Penny Haxell (University of Waterloo)
Sperner's Lemma, Scarf's Lemma and applications in combinatorics
10:30-11:00
Break
11:00-12:00
Jozsef Solymosi (University of British Columbia)
Density versions of theorems from Lecture 2

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-15:00
Nathan (Nati) Linial (Hebrew University)
Expander graphs and their applications
15:00-15:30
Break
15:30-16:30
Peter Keevash (Queen Mary, University of London)
Extremal Set Theory
Printable Version