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

DOI10.1016/J.ENDM.2015.06.090MaRDI QIDQ322349zbMATH OpenOpenAlexFDO

Authors 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 coloringedge densitytriangle-free graphscritical graphs

Mathematics Subject Classification ID

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

Recommendations

• On the minimum number of edges in triangle-free 5-critical graphs
• On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five
• Critical graphs without triangles: an optimum density construction
• Structure in sparse k-critical graphs

Cites work

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

Cited in

(7)

• On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five
• On the minimum edge-density of 5-critical triangle-free graphs
• On the minimum number of edges in triangle-free 5-critical graphs
• A density bound for triangle‐free 4‐critical graphs
• Structure in sparse k-critical graphs
• On the number of \(C_ 5's\) in a triangle-free graph
• Critical graphs without triangles: an optimum density construction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322349)