- Series
- Graph Theory Working Seminar
- Time
- Wednesday, March 13, 2019 - 4:30pm for 1 hour (actually 50 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. The conjecture
is still open for Δ=4. We show the conjecture is true when an edge cut
of size 1 or 2 exists, and in certain cases when an edge cut of size 4
or 3 exists.