Please note: This seminar will take place in DC 1302 and online.
Martin Costa, PhD student
Theory and Foundations Group, University of Warwick
Vizing’s theorem states that any n-vertex m-edge graph of maximum degree Δ can be edge colored using at most Δ + 1 different colors [Vizing, 1964]. Vizing’s original proof is algorithmic and shows that such an edge coloring can be found in O(mn) time. This was subsequently improved to Õ(mn^(1/2)) time, independently by [Arjomandi, 1982] and by [Gabow et al., 1985].
Very recently, this runtime bound was further improved to Õ(n^2) by [Assadi et al., 2024] and Õ(mn^(1/4)) by [Bhattacharya et al., 2024].
In this talk, I will present a randomized algorithm that computes a (Δ + 1)-edge coloring in near-linear time—in fact, only O(m log Δ) time—with high probability, giving a near-optimal algorithm for this fundamental problem.
To attend this seminar in person, please go to DC 1302. You can also attend virtually on Zoom.