GTC Seminars Spring 2018 – Combinatorics Research Group

Spring 2018

2018-01-23 – Boris Bukh – Topological version of Pach’s overlap theorem
2018-01-30 – Emily Heath – An improved upper bound for the (5,5)-coloring number of K_n
2018-02-06 – Douglas West – The Slow-coloring Game: Online Sum-Paintability
2018-02-13 – Jeffrey Mudrock – Proportional Choosability: A New List Analogue of Equitable Coloring
2018-02-20 – Anton Bernshteyn – Fractional DP-Colorings
2018-02-27 – Amin Bahmanian – Extending edge-colorings of complete hypergraphs into regular colorings
2018-03-06 – Zoltán Füredi – Some important combinatorial sequences
2018-03-13 – Bernard Lidicky – On large bipartite subgraphs in dense H-free graphs
2018-03-20 – Spring Break
2018-03-27 – Anton Bernshteyn – A containers-type theorem for algebraic hypergraphs
2018-04-03 – Xujun Liu – Packing chromatic number of subdivisions of cubic graphs
2018-04-10 – Gyorgy Turan – Directed hypergraphs
2018-04-17 – Ruth Luo – The Erdős–Gallai theorem for cycles in hypergraphs
2018-04-24 – Andre Raspaud – Colorings of signed graphs – a short survey
2018-05-01 – Xiangwen Li – Planar graphs without adjacent cycles of length at most 8 are 3-choosable