K4$K_4$‐free graphs have sparse halves

DOI10.1112/blms.12782zbMath1521.05085arXiv2108.07297OpenAlexW4313365414MaRDI QIDQ6096775

Christian Reiher

Publication date: 15 September 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Mantel's theorembalanced tripartite graphssparse halves conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse halves in dense triangle-free graphs
• The critical window for the classical Ramsey-Turán problem
• More results on Ramsey-Turán type problems
• Triangle-free graphs whose independence number equals the degree
• On a Ramsey-Turán type problem
• A local density condition for triangles
• Some old and new problems in various branches of combinatorics
• On the edge distribution in triangle-free graphs
• On the Ramsey-Turán density of triangles
• On the local density problem for graphs of given odd-girth
• The Ramsey-Turán problem for cliques
• Sparse halves in triangle-free graphs
• More about sparse halves in triangle-free graphs
• Über ein Extremalproblem der Graphentheorie
• Sparse halves in K4‐free graphs

This page was built for publication: K4$K_4$‐free graphs have sparse halves