Skip to content
Fall 2016
- 2016-08-23 Alexandr Kostochka– The structure of large intersection families
- 2016-08-30 József Balogh– Some applications of the container method in discrete geometry
- 2016-09-06 Luke Postle– Canvases and Coloring
- 2016-09-13 Doug West– Online Sum Paintability: The Slow-Coloring Game
- 2016-09-20 Yan Wang– The Kelmans-Seymour Conjecture
- 2016-09-27 Ruth Luo– Stability theorems for graphs without long cycles
- 2016-10-04 Anton Bernshteyn – Measurable combinatorics and the Lovász Local Lemma
- 2016-10-11 Michelle Delcourt– Star decompositions of random regular graphs
- 2016-10-18 Adam Zsolt Wagner– Supersaturation in the Boolean lattice and Kleitman’s conjecture
- 2016-10-25 Sarah Loeb– Fractional Separation Dimension
- 2016-11-01 Hannah Spinoza – Reconstruction from $k$-decks for graphs with maximum degree 2
- 2016-11-08 Xujun Liu – Two Counterexamples in Planar Graph Coloring
- 2016-11-15 Benjamin Reiniger– Capture time in the game Cops and Robbers
- 2016-11-22 Thanksgiving
- 2016-11-29 Anton Bernshteyn – Dirac’s theorem and DP-colorings
- 2016-12-06 Spencer Gordon – The complexity of the Colorful Carathéodory Theorem and other total search problems