GTC Seminars Fall 2018

Fall 2018

  • 2018-08-28 – József Balogh– The method of hypergraph containers
  • 2018-09-04 – Dara Zirlin – Cut-edges and regular factors in regular graphs of odd degree
  • 2018-09-11 – Yifan Jing – Polynomial-Time Approximation Scheme for the Genus of Dense Graphs
  • 2018-09-18 – Lina Li – Typical structure of Gallai colorings
  • 2018-09-25 – Ruth Luo – Generalized Turan problems for graphs and hypergraphs
  • 2018-10-02 – Alexandr Kostochka – Long paths and large matchings in ordered and convex geometric hypergraphs
  • 2018-10-09 – Anush Tserunyan – Independent sets in algebraic hypergraphs
  • 2018-10-16 – Peter Erdos – Sampling bipartite degree sequence realizations – the Markov chain approach
  • 2018-10-23 – Songling Shan – Hamiltonian cycles in tough P₂∪P₃-free graphs
  • 2018-10-30 – George Shakan – The Sum-product conjecture
  • 2018-11-06 – Philippe di Francesco – Paths and Arctic Curves: the Tangent Method at Work
  • 2018-11-13 – Zoltán Füredi – Special four cycles in triple systems
  • 2018-11-20 – Thanksgiving
  • 2018-11-27 – Mikhail Lavrov – How many edges guarantee a monochromatic ordered path?
  • 2018-12-04 – Derrek Yager – On Vertex-Disjoint Chorded Cycles