Skip to content
Fall 2017
- 2017-08-29 – Douglas B. West– On-line Size Ramsey Number for Ordered Tight Paths
- 2017-09-05 – Mikhail Lavrov– An improved upper bound for the Hales-Jewett number HJ(4,2)
- 2017-09-12 – Matt Yancey – Finding the Extremal Functions for the Spread and the Subgaussian Constant
- 2017-09-19 – Dana Neidinger– Ramsey Numbers of Interval 2-chromatic Ordered Graphs
- 2017-09-26 – József Balogh– An improved lower bound for Folkman’s theorem
- 2017-10-03 – Anton Bernshteyn– Baire measurable colorings of group actions
- 2017-10-10 – Xujun Liu – Packing chromatic number of cubic graphs
- 2017-10-17 – Hemanshu Kaul– List Coloring Cartesian Products of Graphs: Criticality and the List Color Function
- 2017-10-24 – Adam Wagner– How to construct good voting trees
- 2017-10-31 – Misha Lavrov– Network creation and distance uniformity
- 2017-11-07 – Michael Santana– Disjoint cycles in graphs with bounded independence number
- 2017-11-14 – Felix Clemen – Sharp thresholds for random constraint satisfaction problems
- 2017-11-21 – Thanksgiving
- 2017-11-28 – Alexandr Kostochka– Hypergraphs not containing a given tight tree with a small core
- 2017-12-05 – József Balogh– A short proof of a variant of the container lemma for 3-uniform hypergraphs
