Title: Induced Cycles and Coloring
Speaker: Maria Chudnovsky, Princeton University
Date: Monday, October 19, 2015 2:00 pm
Location: Hill center, Room 425, 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 complements of one behave very well with respect to coloring. But what happens if only some induced cycles (and no complements) are excluded? Gyarfas made a number of 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 recent progress on some of these conjectures.
This is joint work with Alex Scott and Paul Seymour.