Frida, November 13th, 2015 | 4pm-5pm | TBA |

Ohio State University

Kempe equivalence of colourings

Given a colouring of a graph, a Kempe change is the operation of picking a maximal bichromatic subgraph and switching the two colours in it. Two colourings are Kempe equivalent if they can be obtained from each other through a series of Kempe changes. Kempe changes were first introduced in a failed attempt to prove the Four Colour Theorem, but they proved to be a powerful tool for other colouring problems. They are also relevant for more applied questions, most notably in theoretical physics. Consider a graph with no vertex of degree more than some integer D. In 2007, Mohar conjectured that all its D-colourings are Kempe-equivalent. Since 1981, we know from Las Vergnas and Meyniel that this is true if the graph is not D-regular. Feghali, Johnson and Paulusma proved earlier this year that 3-regular graphs also satisfy the conjecture, with the exception of the 3-prism (two triangles joined by a matching) which disproves it. We settle the remaining cases by proving that all k-colourings of a k-regular graph are Kempe equivalent for k at least 4. This is a joint work with Nicolas Bousquet (LIRIS, Ecole Centrale Lyon, France), Carl Feghali (Durham University, UK) and Matthew Johnson (Durham University, UK).