Books versus Triangles at the Extremal Density

DOI10.1137/19M1261766zbMath1432.05056arXiv1905.05312OpenAlexW3005559884MaRDI QIDQ5215901

David Conlon, Jacob Fox, Benjamin Sudakov

Publication date: 13 February 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

booksextremal graph theoryRademacher-type theorems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (1)

Short proofs of some extremal results III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique density theorem
• On a theorem of Rademacher-Turán
• How to make a graph bipartite
• The minimum number of triangles in graphs of given order and size
• Books in graphs
• Books Versus triangles
• The number of cliques in graphs of given order and size
• On the Minimal Density of Triangles in Graphs
• On complete subgraphs of different orders

This page was built for publication: Books versus Triangles at the Extremal Density