Skip to content
Spring 2017
- 2017-01-24 – Alexandr Kostochka– Many T copies in H-free subgraphs of random graphs
- 2017-01-31 – Anton Bernshteyn – DP-colorings of graphs with high chromatic number
- 2017-02-07 – Ruth Luo– The maximum number of cliques in graphs without long cycles
- 2017-12-14 – Šárka Petříčková – Families in posets minimizing the number of comparable pairs
- 2017-02-21 – Douglas B. West– Reconstruction from the deck of k-vertex induced subgraphs
- 2017-02-28 – Mikhail Lavrov– Distance-uniform graphs with large diameter
- 2017-03-07 – Gexin Yu– The strong chromatic index of graphs with maximum degree four is 21
- 2017-03-14 – Katie Anders– Rooted forests that avoid sets of permutations
- 2017-03-21 – Spring Break
- 2017-03-28 – Zoltán Füredi– Combinatorial geometry problems and Turan hypergraphs
- 2017-04-04 – Mariusz Meszka– Orthogonal one-factorizations of complete multipartite graphs
- 2017-04-11 – Jaehoon Kim– On the number of Hamiltonian subset
- 2016-04-18 – Kevin Ford– Permutations fixing k-sets and applications to group theory
- 2017-04-25 – Chao Xu– Small k-certificate in hypergraphs and representing all min-cuts
- 2017-05-02 – Louis DeBiasio– Infinite graph-Ramsey theory
