On the minimum number of edges in triangle-free 5-critical graphs

DOI10.1016/j.ejc.2017.06.026zbMath1369.05085arXiv1602.03098OpenAlexW2963982977MaRDI QIDQ2403700

Luke Postle

Publication date: 11 September 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

sparse graphs\(k\)-critical graphs

Mathematics Subject Classification ID

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

Related Items (1)

A density bound for triangle‐free 4‐critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum edge-density of 5-critical triangle-free graphs
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Ore's conjecture on color-critical graphs is almost true
• On the minimal number of edges in color-critical graphs
• A Brooks-type result for sparse critical graphs
• Three-coloring Klein bottle graphs of girth five
• Extracting List Colorings from Large Independent Sets
• On the number of edges in colour-critical graphs and hypergraphs

This page was built for publication: On the minimum number of edges in triangle-free 5-critical graphs