Strong chromatic index and Hadwiger number

We investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs. We conjecture for each $k\ge 4$ that any $K_k$-minor-free multigraph of maximum degree $\Delta$ has strong chromatic index at most $\frac32(k-2)\Delta$. We present a construction certifying that if true the conjecture is asymptotically sharp as $\Delta\to\infty$. In support of the conjecture, we show it in the case $k=4$ and prove the statement for strong clique number in place of strong chromatic index. By contrast, we make a basic observation that for $K_k$-minor-free simple graphs, the problem of strong edge-colouring is "between" Hadwiger's Conjecture and its fractional relaxation. We also treat $K_k$-minor-free multigraphs of edge-diameter at most $2$.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2021

Asymptotic Equivalence of Hadwiger's Conjecture and its Odd Minor-Variant

Hadwiger's conjecture states that every K_t-minor free graph is (t-1)-co...
research
08/03/2021

Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs

In 1943, Hadwiger conjectured that every graph with no K_t minor is (t-1...
research
07/15/2020

An improved procedure for colouring graphs of bounded local density

We develop an improved bound for the chromatic number of graphs of maxim...
research
06/09/2023

Proof of the Clustered Hadwiger Conjecture

Hadwiger's Conjecture asserts that every K_h-minor-free graph is properl...
research
07/14/2021

On complete classes of valuated matroids

We characterize a rich class of valuated matroids, called R-minor valuat...
research
06/30/2020

Counting Homomorphisms to K_4-minor-free Graphs, modulo 2

We study the problem of computing the parity of the number of homomorphi...
research
09/10/2022

Towards Diversity-tolerant RDF-stores

We propose a novel approach to designing RDF-stores with the goal of imp...

Please sign up or login with your details

Forgot password? Click here to reset