Proof of the Core Conjecture of Hilton and Zhao

preprint2020arXivOpen access

Abstract

Let GG be a simple graph with maximum degree ΔΔ. We call GG \emph{overfull} if ∣E(G)∣>Δ⌊∣V(G)∣/2⌋|E(G)|>Δ\lfloor |V(G)|/2\rfloor. The \emph{core} of GG, denoted GΔG_Δ, is the subgraph of GG induced by its vertices of degree ΔΔ. A classic result of Vizing shows that χ′(G)χ'(G), the chromatic index of GG, is either ΔΔ or Δ+1Δ+1. It is NP-complete to determine the chromatic index for a general graph. However, if GG is overfull then χ′(G)=Δ+1χ'(G)=Δ+1. Hilton and Zhao in 1996 conjectured that if GG is a simple connected graph with Δ≥3Δ\ge 3 and Δ(GΔ)≤2Δ(G_Δ)\le 2, then χ′(G)=Δ+1χ'(G)=Δ+1 if and only if GG is overfull or G=P∗G=P^*, where P∗P^* is obtained from the Petersen graph by deleting a vertex. This conjecture, if true, implies an easy approach for calculating χ′(G)χ'(G) for graphs GG satisfying the conditions. The progress on the conjecture has been slow: it was only confirmed for Δ=3,4Δ=3,4, respectively, in 2003 and 2017. In this paper, we confirm this conjecture for all Δ≥4Δ\ge 4.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.