MenuAlgebra and Combinatorics Seminar
Date: October 11, 2019
Time: 3:00PM - 3:50PM
Location: BLOC 628
Speaker: Chun-Hung Liu, Texas A&M University
Title: Length of cycles in non-sparse graphs
Abstract: Intuitively, "dense" graphs contain any "desired substructure". In this talk, we will use a unified tool to prove few conjectures and open questions proposed since 1980s with this flavor, where the "desired substructure" is a set of cycles whose lengths satisfy certain conditions. They include two conjectures of Thomassen about minimum degree, a conjecture of Dean about connectivity, a conjecture of Sudakov and Verstraete about chromatic number, and an optimal answer of a question of Bondy and Vince about minimum degree. Joint work with Jun Gao, Qingyi Huo and Jie Ma.
