paper

On a recolouring version of Hadwiger's conjecture

arXiv:2103.10684

Abstract

We prove that for any , for any large enough , there is a graph that admits no -minor but admits a -colouring that is "frozen" with respect to Kempe changes, i.e. any two colour classes induce a connected component. This disproves three conjectures of Las Vergnas and Meyniel from 1981.

5 pages

On a recolouring version of Hadwiger's conjecture · wovepaper