Skip to content
Spring 2015
- 2015-01-20 Benjamin Reiniger– Sparse bipartite large-girth graphs that are not k-choosable (and related topics)
- 2015-01-27 Douglas West– Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for k ≤ 2.
- 2015-02-03 Andrew McConvey – Toward Żak’s conjecture on graph packing
- 2015-02-10 Anton Bernshteyn – 3-regular subgraphs of 4-regular pseudographs and (3,1)-colorings
- 2015-02-17 Michael Plantholt – Decomposing Regular Graphs Into 4-Regular Graphs with Triangle-free Euler Tours
- 2015-02-24 Kevin Ford– New results for efficient hypergraph covering with application to large prime gaps
- 2015-03-03 Theodore Molla– Arbitrary orientations of Hamilton cycles in digraphs
- 2015-03-10 Jacques Verstraete– Injective labelings of graphs
- 2015-03-17 Bernard Lidický– Precoloring distant vertices in triangle-free planar graphs
- 2015-03-24 Spring Break
- 2015-03-31 Zoltán Füredi – Stability of extremal graphs, Simonovits’ stability from Szemerédi’s regularity
- 2015-04-07 Zsolt Adam Wagner– Cops and Robbers on diameter two graphs
- 2015-04-14 Andrew Treglown– On degree sequences forcing the square of a Hamilton cycle
- 2015-04-21 Gyula O. H. Katona– Largest families of sets, under conditions defined by a given poset
- 2015-04-28 Tom Mahoney– Multicoloring and Paintability
- 2015-05-05 Keivan Hassani Monfared– Spectral characterization of graphs with a given matching number k
- 2015-05-11 Caroline Terry– Extremal combinatorics and logical zero-one laws
