- Series
- Graph Theory Working Seminar
- Time
- Wednesday, October 3, 2018 - 4:30pm for 1.5 hours (actually 80 minutes)
- Location
- Skiles 006
- Speaker
- James Anderson – Georgia Tech
- Organizer
- Xingxing Yu
Erdős and Nešetřil conjectured in 1985 that every graph with maximum degree Δ can be strong edge colored using at most (5/4)Δ^2 colors. In this talk we discuss recent progress made in the case of Δ=4, and go through the method used to improve the upper bound to 21 colors, one away from the conjectured 20.