Critical graphs without triangles: an optimum density construction

DOI10.1007/s00493-013-2440-1zbMath1349.05122arXiv1101.4417OpenAlexW2128065725MaRDI QIDQ2439835

Wesley Pegden

Publication date: 17 March 2014

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numbercritical graphmaximal density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Domination game critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hypergraph-free construction of highly chromatic graphs without short cycles
• The chromatic number of the product of two 4-chromatic graphs is 4
• On the chromatic number of triangle-free graphs of large minimum degree
• Dense critical and vertex-critical graphs
• Triangle-free four-chromatic graphs
• On the chromatic number of pentagon-free graphs of large minimum degree
• On a valence problem in extremal graph theory
• Fractional chromatic numbers of cones over graphs
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On the Structure of Dense Triangle-Free Graphs
• On graphs with strongly independent color-classes
• On chromatic number of finite set-systems
• On the structure of linear graphs
• Sur le coloriage des graphs
• On the number of edges in colour-critical graphs and hypergraphs

This page was built for publication: Critical graphs without triangles: an optimum density construction