The ACO Seminar (2019–2020)

Vizing's theorem states any graph of maximum degree $d$ can be properly edge-coloured with $d+1$ colours. We present a measurable version of this result, thus answering a question posed by Miklós Abért. This is joint work with Jan Grebík.

Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.