- Series
- Graph Theory Seminar
- Time
- Tuesday, October 1, 2024 - 3:30pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Guantao Chen – Georgia State University – https://math.gsu.edu/gchen/
- Organizer
- Evelyne Smith-Roberge
The Goldberg-Seymour Conjecture asserts that if the chromatic index χ′(G) of a loopless multigraph G exceeds its maximum degree Δ(G)+1, then it must be equal to another well known lower bound Γ(G), defined as
Γ(G)=max{⌈2|E(H)|(|V(H)|−1)⌉ : H⊆G and |V(H)| odd }.
In this talk, we will outline a short proof, obtained recently with Hao, Yu, and Zang.