GTC Seminars Fall 2019 – Combinatorics Research Group

Fall 2019

2019-08-20 – Xuding Zhu – Refinements of Choice Number of Graphs
2019-08-27 – Seog-Jin Kim – The Alon-Tarsi number of subgraphs of a planar graph
2019-09-03 – Sean English – Large Monochromatic Components in Sparse Random Hypergraphs
2019-09-10 – Adam Wagner – The largest projective cube-free subsets of ℤ₂ⁿ
2019-09-17 – Amin Bahmanian – Connected Fair Detachments of Hypergraphs
2019-09-24 – Fuhong Ma – Defective DP-colorings of sparse multigraphs
2019-10-01 – Mikhail Lavrov – Long monochromatic paths and cycles in 2-edge-colored graphs with large minimum degree
2019-10-08 – Zoltán Füredi – Problems and results on 1-cross intersecting set pair systems
2019-10-15 – Zilin Jiang – Equiangular lines with a fixed angle
2019-10-22 -József Balogh – River landscapes and Optimal Channel Networks
2019-10-29- Andrew Treglown – A bandwidth theorem for locally dense graphs
2019-11-05 – Dara Zirlin – Super-pancyclic hypergraphs and bipartite graphs
2019-11-12 – Zoltán Füredi – Extremal graphs without 4-cycles
2019-11-19 – Lina Li – An overview of Erdős-Rothschild problems and their rainbow variants
2019-11-26 – André Kündgen – Nonrepetitive Graph Coloring
2019-12-03 – Xujun Liu – Monochromatic cycles of given length in 2-edge-colored graphs with large minimum degree