Literature Seminar in Combinatorics Spring 2021

2021-01-26 – Alberto Espuny Diaz (TU Ilmenau) – Hamiltonicity of random subgraphs of the hypercube

2021-02-02 – Anna Johnsen (Illinois State University) – Embedding factorizations of hypergraphs

2021-02-09 – Bob Krueger (UIUC) – Transference of the Erdős-Ko-Rado Theorem

2021-02-16 – Huang Hao (Emory University) – Open problems in Extremal Set Theory

2021-02-23 – Xujun Liu (UIUC) – Secretary type problems under the Mallows model

2021-03-02 – Haoran Luo (UIUC) – A Proof of the Upper Matching Conjecture for Large Graphs (by Davies, Jenssen, and Perkins)

2021-03-09 – Igor Araujo (UIUC) – An Introduction to Entropy and Counting

2021-03-16 – Jingwei Xu (UIUC) – Injective edge-coloring of graphs with given maximum degree

2021-03-23 – Grigory Terlov (UIUC) – Exponential Random Graphs

2021-03-30 – Ramon I. Garcia (UIUC) – K_4-intersecting families of graphs (by Berger and Zhao)

2021-04-06 – Felix Christian Clemen (UIUC) – Making H-free graphs k-partite

2021-04-13 – Robert Morris (IMPA, Brazil) – My favourite problems

2020-04-20 – Amedeo Sgueglia (LSE) – Clique and cycle factors in randomly perturbed graphs

2020-04-27 – Bob Krueger (UIUC) – Poisson Upper Tails for Triangles

2020-05-04 – We recommend: Mini-workshop on Graph Container methods

2020-05-11 – Aditya Potukuchi (UIC) – Enumerating independent sets in Abelian Cayley graphs

2020-05-18 – Adam Wagner (Tel Aviv University) – Constructions in combinatorics via neural networks