ACO Seminar - Dhruv Mybayi February 13, 2025 3:00pm — 4:00pm Location: In Person - Wean Hall 8220 Speaker: DHRUV MUBAYI, Professor, Department of Mathematics, Statistics, and Computer Science, University of Illinois Chicago http://homepages.math.uic.edu/~mubayi/ What is the maximum size of a triangle-free subgraph that every n vertex K4–free graph is guaranteed to contain? This problem was posed by Hajnal, Erdos and Rogers in the 1960s as a way to generalize classical graph Ramsey numbers. We prove almost optimal results using recent constructions in Ramsey theory. We also consider the problem where we replace triangle and K4 by arbitrary graphs H and G and discover several interesting new phenomena. This is joint work with Jacques Verstraete.4:00 pm → Jane Street-sponsored tea and cookies in Wean 6220 (bring your own mug). Event Website: https://aco.math.cmu.edu/abs-24-25/feb13.html Add event to Google Add event to iCal
