EXCILL: Extremal Combinatorics at Illinois

November 18-20, 2006

A conference hosted by the Department of Mathematics,
University of Illinois at Urbana-Champaign


Organizers: J. Balogh, Z. Füredi, S. Hartke, A. Kostochka, and D. B. West

Slides Provided by Speakers

G. Chen (Georgia State U.)
Linkages with Modulo Constraints; PDF
M. Jacobson (U. Colorado, Denver)
Graphs that have Hamiltonian Cycles Avoiding Sets of Edges; PowerPoint
H. Kierstead (Arizona State U.)
On-line Ramsey Theory; PDF
D. J. Kleitman (Massachusetts Inst. of Tech.)
Some Problems on Reducing Planar Graphs to Forests; PDF 1, PDF 2
V. Nikiforov (U. Memphis)
Improving some "good" Ramsey results; PDF
O. Pikhurko (Carnegie-Mellon U.)
Minimum H-Decompositions of Graphs; PDF
A. Sali (Hungarian Acad. of Sciences)
Codes that attain minimum distance in all possible directions; PDF
G. Sárközy (Worcester Polytechnic Inst.)
New coloring applications of the Regularity Lemma; PDF 1, PDF 2, PDF 3, PDF 4
J. Solymosi (U. British Columbia, Canada)
Partition Regular Sets of Matrices; PDF
R. Schelp (U. Memphis)
Cycles and Stability; PDF
W. T. Trotter (Georgia Inst. of Tech.)
A Fresh Look at Some Old Extremal Problems; PowerPoint
P. Winkler (Dartmouth Coll.)
Random Walk with Planted Coins; PowerPoint


Back to EXCILL webpage.