On the minimum edge-density of 5-critical triangle-free graphs

DOI10.1016/J.ENDM.2015.06.090zbMath1346.05081OpenAlexW2216284970MaRDI QIDQ322349

Luke Postle

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.090

zbMATH Keywords

graph coloringcritical graphstriangle-free graphsedge density

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (3)

On the minimum edge-density of 5-critical triangle-free graphs ⋮ On the minimum number of edges in triangle-free 5-critical graphs ⋮ Structure in sparse \(k\)-critical graphs

Cites Work

• On the minimum edge-density of 5-critical triangle-free graphs
• Ore's conjecture on color-critical graphs is almost true
• A Brooks-type result for sparse critical graphs
• Improved lower bounds on the number of edges in list critical and online list critical graphs

This page was built for publication: On the minimum edge-density of 5-critical triangle-free graphs