Algebra and Combinatorics Seminar

Date: November 5, 2021

Time: 3:00PM - 4:00PM

Location: Zoom

Speaker: Guoli Ding, Louisiana State University

Title: New results on unavoidable large graphs

Abstract: Ramsey theorem states that a large clique or coclique is unavoidable in every sufficiently large graph. This result can be extended to graphs of other connectivity. For instance, a big W_n- or K_{3,n}-minor is unavoidable in every sufficiently large 3-connected graph. In this talk we present similar results including results for rooted graphs.