Event Title: OR
Speaker Last Name:    OR
Year: (yyyy)

Mathematics Colloquium


Date:  Friday, February 17, 2017

Title:  Induced subgraphs and coloring

Abstract:  What causes a graph to have high chromatic number? One reason is that the graph may contain a large set of pairwise adjacent vertices (called a "clique"), but what can be said if that is not the case? Around 1985 Andras Gayfas made three conjectures about structures that must be present in a graph with large chromatic number all of whose cliques have bounded size. Recently we proved the strongest of these conjectures, that implies the other two. In this talk we will discuss some of the proof ideas, and related problems and theorems.

Speaker:  Maria Chudnovsky
Institution:  Princeton University


Back to current Colloquium List
Back to UM Math seminars page


Department of Mathematics   |   2074 East Hall   |  530 Church Street  
Ann Arbor, MI 48109-1043
Phone: 734.764-0335   |   Fax: 734.763-0937

The page last modified
Site errors should be directed to