May 5-9, 2008 |
| The conference program consisted of invited lectures listed below, poster presentations and a problem session on Tuesday afternoon. |
| Monday, May 5 | Presentation | |
|---|---|---|
| 7:30-8:45 | Breakfast and registration | |
| 8:45-9:00 | Dean Paul Houston | Opening Remarks |
| 9:00-9:40 | Paul Seymour | Perfect Matchings in Planar Cubic Graphs |
| 9:40-10:20 | Endre Szemeredi | A Dirac-Type Theorem for 3-Uniform Hypergraphs |
| 10:20-10:50 | Coffee Break | |
| 10:50-11:30 | Maria Chudnovsky | K2,t Minors in Dense Graphs |
| 11:30-12:10 | Van Vu | Some Recent Results on Random Matrices |
| 12:10-2:00 | Lunch | |
| 2:00-2:40 | Zoltan Furedi | Looking for 14-Cycles in the Cube |
| 2:40-3:20 | Alexandr Kostochka | On Graph Packing Theorems by Sauer and Spencer |
| 3:20-3:50 | Coffee Break | |
| 3:50-4:30 | Dhruv Mubayi | Three Problems in Extremal Set Theory |
| 4:30-5:10 | Benny Sudakov | Ramsey Numbers of Sparse Graphs and Hypergraphs |
| 5:10-5:20 | Fred Roberts | A Few Words About Tom Trotter |
| 5:15- | Welcome Reception | Klaus Atrium: Poster Displays | Tuesday, May 6 | Presentation |
| 8:00-9:00 | Breakfast | |
| 9:00-9:40 | Bela Bollobas | Random Graphs and Branching Processes |
| 9:40-10:10 | Joel Spencer | The Erdos-Renyi Phase Transition |
| 10:10-10:30 | Thomas Bohman | Triangle-free Process |
| 10:30-10:50 | Coffee Break | |
| 10:50-11:30 | Angelika Steger | On Boltzmann Samplers and Properties of Combinatorial Structures |
| 11:30-12:10 | Jacques Verstraete | Cycles in Sparse Graphs |
| 12:10-2:00 | Lunch | |
| 2:00-2:40 | William Cook | Numerically Accurate Solutions in Linear and Integer Programming |
| 2:40-3:20 | Kamal Jain | Iterative Rounding in Graph Connectivity Problems |
| 3:20-3:50 | Coffee Break | |
| 3:50-4:30 | Dan Kleitman | Some Problems from the Past and Some Speculation about the Future |
| 4:30-5:10 | Problem Session | Wednesday, May 7 | Presentation |
| 8:00-9:00 | Breakfast | |
| 9:00-9:40 | Jeffry Kahn | Correlation Questions |
| 9:40-10:20 | Penny Haxell | On Sperner's Lemma and Scarf's Lemma |
| 10:20-10:50 | Coffee Break | |
| 10:50-11:30 | Andrzej Rucinski | Subhypergraph Counts in Extremal and Random Hypergraphs and the Fractional q-Independence |
| 11:30-12:10 | Carla Savage | Lattice Point Enumeration, Linear Extensions, and the Theory of Partitions |
| 12:10-2:00 | Lunch | |
| Free Afternoon | Free Time | |
| 6:30- | Banquet | Klaus Atrium | Thursday, May 8 | Presentation |
| 8:00-9:00 | Breakfast | |
| 9:00-9:40 | Michael Saks | Distributed Monotonicity Reconstruction |
| 9:40-10:20 | Peter Winkler | Branched Polymers |
| 10:20-10:50 | Coffee Break | |
| 10:50-11:30 | Fan Chung Graham | The PageRank of a Graph |
| 11:30-12:10 | Hal Kierstead | On-line Partitioning |
| 12:10-2:00 | Lunch | |
| 2:00-2:40 | Jan Kratochvil | Geometric Representations of Graphs |
| 2:40-3:20 | Imre Barany | Extremal Problems for Convex Lattice Polytopes |
| 3:20-3:50 | Coffee Break | |
| 3:50-4:30 | Janos Pach | String Graphs and Partial Orders |
| 4:30-5:10 | Miklos Simonovits | On the Number of High Multiplicity Points for 1-Parameter Families of Curves | Friday, May 9 | Presentation |
| 8:00-9:00 | Breakfast | |
| 9:00-9:40 | Jerrold Griggs | Large Families of Subsets Avoiding a given Configuration |
| 9:40-10:20 | Graham Brightwell | Random Linear Extensions of Infinite Posets |
| 10:20-10:50 | Coffee Break | |
| 10:50-11:30 | Stefan Felsner | ULD-Lattices, Instances and Applications |
| 11:30-12:10 | Douglas West | Bounds for the k-Dimension of Products of Special Posets |
| 12:10-2:00 | Lunch |
Last modified: May 16, 2008