DisCoMath Seminar: Chi-boundedness
Discrete & Computational Math Seminar (DisCoMath)
Assistant Professor of Mathematics
If a graph has bounded clique number, and sufficiently large chromatic number, what can we say about its induced subgraphs? In the early 1980's András Gyárfás made a number of challenging conjectures about this. In this talk, we will give a brief survey of how these questions seek to generalize the class of perfect graphs, along with some recent results.
Undergraduates, graduates, and experts. Those with interest in the topic.
When and Where
This is an RIT Only Event