Dense graphs with small clique number

DOI10.1002/jgt.20505zbMath1298.05188OpenAlexW1968471470MaRDI QIDQ3168661

Jeremy Lyle, Wayne Goddard

Publication date: 19 April 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20505

zbMATH Keywords

homomorphismminimum degreecliquecoloringdense graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (14)

The chromatic profile of locally colourable graphs ⋮ Hypergraphs with zero chromatic threshold ⋮ The chromatic profile of locally bipartite graphs ⋮ A counting lemma for binary matroids and applications to extremal problems ⋮ Minimum degree and the graph removal lemma ⋮ The critical number of dense triangle-free binary matroids ⋮ The minimum degree removal lemma thresholds ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\) ⋮ The binding number of a graph and its cliques ⋮ On the structure of Dense graphs with bounded clique number ⋮ Homomorphism thresholds for odd cycles

Cites Work

• The binding number of a graph and its pancyclism
• \(H\)-free graphs of large minimum degree
• On the structure of triangle-free graphs of large minimum degree
• Graphs without short odd cycles are nearly bipartite
• On the chromatic number of triangle-free graphs of large minimum degree
• Nearly bipartite graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Odd wheels in graphs
• On a valence problem in extremal graph theory
• Subgraphs in vertex neighborhoods ofKr-free graphs
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• A note on maximal triangle‐free graphs
• Triangle-Free Graphs with High Minimal Degrees
• Triangle-Free Graphs with Large Degree
• The binding number of a graph and its Anderson number

This page was built for publication: Dense graphs with small clique number