Corrigendum to: ``A local epsilon version of Reed's conjecture

DOI10.1016/j.jctb.2021.06.004zbMath1472.05052arXiv1911.02672OpenAlexW3176613508WikidataQ122938011 ScholiaQ122938011MaRDI QIDQ1984533

Luke Postle, Tom Kelly

Publication date: 16 September 2021

Published in: Electronic Notes in Discrete Mathematics, Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.02672

zbMATH Keywords

graph coloringclique numberprobabilistic methodcritical graphscoloringReed's conjecturelist-coloringDP-coloringlocal versioncorrespondence-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

Corrigendum to: ``A local epsilon version of Reed's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• On the list coloring version of Reed's conjecture
• Corrigendum to: ``A local epsilon version of Reed's conjecture
• A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω
• Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ
• A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
• A local epsilon version of Reed's conjecture

This page was built for publication: Corrigendum to: ``A local epsilon version of Reed's conjecture