On the structure of Dense graphs with bounded clique number

DOI10.1017/S0963548319000324zbMath1462.05203arXiv1602.02302MaRDI QIDQ4987252

Mathias Schacht, Heiner Oberkampf

Publication date: 30 April 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

chromatic threshold3-colourable triangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Density (toughness, etc.) (05C42)

Related Items (2)

Minimum degree and the graph removal lemma ⋮ The minimum degree removal lemma thresholds

Cites Work

• Unnamed Item
• Unnamed Item
• Homomorphism thresholds for odd cycles
• On the structure of triangle-free graphs of large minimum degree
• On the chromatic number of triangle-free graphs of large minimum degree
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• The chromatic thresholds of graphs
• On the chromatic number of pentagon-free graphs of large minimum degree
• On a valence problem in extremal graph theory
• Dense graphs with small clique number
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• The homomorphism threshold of ‐free graphs
• On the structure of linear graphs

This page was built for publication: On the structure of Dense graphs with bounded clique number