- Series
- Graph Theory Working Seminar
- Time
- Wednesday, October 17, 2018 - 4:30pm for 1.5 hours (actually 80 minutes)
- Location
- Skiles 006
- Speaker
- Chi-Nuo Lee – 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 focus on a conjecture by R.J. Faudree et al, that Δ^2 holds as a bound for strong chromatic index in bipartite graphs, and related results where a bound is known.