On a recolouring version of Hadwiger's conjecture

Published: 01 Jan 2024, Last Modified: 26 Jul 2025J. Comb. Theory B 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We prove that for any ε>0, for any large enough t, there is a graph that admits no Kt-minor but admits a (32−ε)t-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.
Loading