Pete Maceli spoke at the RIT Discrete and Computational Mathematics Seminar on Oct 15, 2021. Title: Chi-boundedness. Abstract: 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.
Pete Maceli speaks at RIT
By Thomas Pfaff, October 21, 2021