- Series
- Graph Theory Seminar
- Time
- Tuesday, October 17, 2023 - 3:30pm for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Lina Li – Iowa State University – linali@iastate.edu – https://sites.google.com/view/linali/
- Organizer
- Tom Kelly
The Acyclic Edge Coloring Conjecture, posed independently by Fiam\v{c}ik in 1978 and Alon, Sudakov and Zaks in 2001, asserts that every graph can be properly edge colored with $\Delta+2$ colors such that there is no bicolored cycle. Over the years, this conjecture has attracted much attention. We prove that the conjecture holds asymptotically, that is $(1+o(1))\Delta$ colors suffice. This is joint work with Michelle Delcourt and Luke Postle.