Spring 2014
- 2014-01-09 Tereza Klimošová– Infinite dimensional finitely forcible graphon
- 2014-01-21 József Balogh– Typical structure of a Kr -free graph
- 2014-01-28 Gregory J. Puleo– On (4m:2m)-choosability and a conjecture of Voigt
- 2014-02-04 Hao Huang– Maximizing the number of nonnegative subsets
- 2014-02-11 Doug West– Beyond Ohba’s Conjecture: A bound on the choice number of k-chromatic graphs with n vertices
- 2014-02-18 Sarah Loeb– Fool’s Solitaire on Joins and Cartesian Products with Complete Graphs
- 2014-02-25 Louis DeBiasio– Covering 2-edge-colored graphs with a pair of cycles
- 2014-03-04 Alexandr Kazda– Homomorphism extension problem for Maltsev digraphs is easy
- 2014-03-11 Tom Mahoney– Characterization of (2m,m)-paintable graphs
- 2014-03-18 Bernard Lidicky– Tree Search Problem with Non-uniform Costs
- 2014-03-25 Spring Break
- 2014-04-01 Richard Mycroft– Packing k-partite k-graphs
- 2014-04-08 Theodore Molla– Perfect Transitive Triangle Tilings in Oriented Graphs
- 2014-04-15 Šárka Petříčková – Online Ramsey games on planar graphs
- 2014-04-22 Peter Hamburger– New developments on the theory of partially ordered sets
- 2014-04-29 Alexandr Kostochka– Cycles in triangle-free graphs of large chromatic number
- 2014-05-06 József Balogh– On the applications of counting independent sets in hypergraphs