DisCoMath Seminar: Chi-boundedness
Event Image
Discrete & Computational Math Seminar (DisCoMath)
Chi-boundedness
Peter Maceli
Assistant Professor of Mathematics
Ithaca College
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.
Intended Audience:
Undergraduates, graduates, and experts. Those with interest in the topic.
Keep up with DisCoMath Seminars on the DisCoMathS webpage.
To request an interpreter, please visit myaccess.rit.edu
Event Snapshot
When and Where
Who
This is an RIT Only Event
Interpreter Requested?
No
Topics
research