2021/04/09 by Shan, Songling · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2104.06253
Let G be a simple graph with maximum degree Δ(G). A subgraph H of G is overfull if |E(H)|>Δ(G)\lfloor |V(H)|/2 \rfloor. Chetwynd and Hilton in 1985 conjectured that a graph G on n vertices with Δ(G)>n/3 has chromatic index Δ(G) if and only if G contains no overfull subgraph. Glock, Kühn and Osthus in 2016 showed that the conjecture is true for dense quasirandom graphs with even order, and they conjectured that the same should hold for such graphs with odd order. In this paper, we show that the conjecture of Glock, Kühn and Osthus is affirmative.