Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium, Online/Virtual |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
In the early 1980s Gyarfas and Sumner independently conjectured that for every tree $T$, every graph $H$ which does not contain $T$ as an induced subgraph has chromatic number bounded by a function of the maximum size of a clique it contains . I will discuss a proof that for every tree $T$, almost every $T$-free graph has chromatic number equal to the maximum size of a clique it contains. I will discuss related results for $C$-free graphs when $C$ is a cycle.
This is joint work with Lena Yuditsky.
No Notes/Supplements Uploaded No Video Files Uploaded