On a recolouring version of Hadwiger's conjecture

03/19/2021
by   Marthe Bonamy, et al.
0

We prove that for any ε>0, for any large enough t, there is a graph G that admits no K_t-minor but admits a (3/2-ε)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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2018

Seymour's conjecture on 2-connected graphs of large pathwidth

We prove the conjecture of Seymour (1993) that for every apex-forest H_1...
research
11/04/2019

Halfway to Hadwiger's Conjecture

In 1943, Hadwiger conjectured that every K_t-minor-free graph is (t-1)-c...
research
10/26/2022

Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor

We prove that Graph Isomorphism and Canonization in graphs excluding a f...
research
07/10/2018

Polynomial bounds for centered colorings on proper minor-closed graph classes

For p∈N, a coloring λ of the vertices of a graph G is p-centered if for ...
research
08/02/2023

Balanced-chromatic number and Hadwiger-like conjectures

Motivated by different characterizations of planar graphs and the 4-Colo...
research
05/17/2018

On two consequences of Berge-Fulkerson conjecture

The classical Berge-Fulkerson conjecture states that any bridgeless cubi...
research
09/02/2023

Characterising 4-tangles through a connectivity property

Every large k-connected graph-minor induces a k-tangle in its ambient gr...

Please sign up or login with your details

Forgot password? Click here to reset