Saturday November 18 | |
| 9:00 | registration |
| 9:45 | S. Katz (Chair, UIUC Math Dept) Welcoming Remarks |
| 10:00 | R. Thomas (Georgia Inst. of Tech.) |
| 11:00- | coffee |
| 11:30- | P. Haxell (U. Waterloo, Canada) Independent dominating sets and Hamilton cycles |
| 12:00- | D. Mubayi (U. Illinois, Chicago) Erdos-Ko-Rado for three sets |
| 12:30- | lunch |
| 2:00- | J. Kahn (Rutgers U.) Many Hamiltonian cycles |
| 3:00- | P. Balister (U. Memphis) Interference Percolation |
| 3:30- | P. Winkler (Dartmouth Coll.) Random Walk with Planted Coins |
| 4:00- | coffee |
| 4:30- | A. Naor (Microsoft Research) Ramsey theorems on metric spaces |
| 5:00- | J. Griggs (U. South Carolina) Problems in the Boolean Lattice |
| 5:30- | G. Chen (Georgia State U.) Linkages with Modulo Constraints |
| 6:00 | |
| 6:15 | pizza dinner |
Sunday November 19 | |
| 9:30 | D. J. Kleitman (Massachusetts Inst. of Tech.) Some Problems on Reducing Planar Graphs to Forests |
| 10:30- | coffee |
| 11:00- | F. Lazebnik (U. Delaware) On monomial graphs of girth eight |
| 11:30- | J. Pach (New York U.) Coloring Geometric Hypergraphs |
| 12:00- | J. Solymosi (U. British Columbia, Canada) Partition Regular Sets of Matrices |
| 12:30- | lunch |
| 2:00- | B. Bollobás (Cambridge U., UK, and U. Memphis) The Angel and the Devil -- The Final Confrontation |
| 3:00- | A. Gyárfás (Hungarian Acad. of Sciences and U. Memphis) The largest monochromatic double star in edge-colored complete graphs |
| 3:30- | O. Pikhurko (Carnegie-Mellon U.) Minimum H-Decompositions of Graphs |
| 4:00- | coffee |
| 4:30- | B. Sudakov (Princeton U.) Induced subgraphs of Ramsey graphs with many distinct degrees |
| 5:00- | R. Radoičić (Rutgers U.) Turán-type problems for planar intersection graphs |
| 5:30- | T. Jiang (Miami U., Ohio) Anti-Ramsey and constrained Ramsey numbers |
| 6:00 | |
| 6:45 | dinner at Chinatown Buffet |
Monday November 20 | |
| 9:30 | M. Simonovits (Renyi Math. Inst., Hungary) |
| 10:30- | coffee |
| 11:00- | V. Nikiforov (U. Memphis) Improving some "good" Ramsey results |
| 11:30- | G. Sárközy (Worcester Polytechnic Inst.) New coloring applications of the Regularity Lemma |
| 12:00- | R. Schelp (U. Memphis) Cycles and Stability |
| 12:30- | lunch |
| 2:00- | W. T. Trotter (Georgia Inst. of Tech.) A Fresh Look at Some Old Extremal Problems |
| 3:00- | A. Sali (Hungarian Acad. of Sciences) Codes that attain minimum distance in all possible directions |
| 3:30- | M. Jacobson (U. Colorado, Denver) Graphs that have Hamiltonian Cycles Avoiding Sets of Edges |
| 4:00- | H. Kierstead (Arizona State U.) On-line Ramsey Theory |
| 4:30- | N. Robertson (Ohio State U.) On Hadwiger's conjecture |
| 5:00 | |