Title: Induced Cycles and Coloring
Speaker: Maria Chudnovsky, Princeton University
Date: Monday, February 27, 2017 2:00 pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
The Strong Perfect Graph Theorem states that graphs with no induced odd cycle of length at least five, and no complement of one behave very well with respect to coloring. But what happens if only some induced cycles (and no complements) are excluded? Gyarfas made three conjectures on this topic, asserting that in many cases the chromatic number is bounded by a function of the clique number. In this talk we discuss the recent solutions of these conjectures.
This is joint work with Alex Scott, Paul Seymour and Sophie Spirkl.