More about sparse halves in triangle-free graphs

DOI10.1070/SM9615zbMath1485.05087arXiv2104.09406OpenAlexW4205357337MaRDI QIDQ3391027

Alexander A. Razborov

Publication date: 28 March 2022

Published in: Sbornik: Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

triangle-free graphsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

K4$K_4$‐free graphs have sparse halves ⋮ The Spectrum of Triangle-Free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse halves in dense triangle-free graphs
• On the maximum number of five-cycles in a triangle-free graph
• How to make a graph bipartite
• 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 number of pentagons in triangle-free graphs
• On Krein graphs without triangles
• Sparse halves in triangle-free graphs
• Non-Three-Colourable Common Graphs Exist
• The uniqueness of the strongly regular graph on 77 points
• Flag algebras
• There are exactly five biplanes with k = 11
• Graphs with Maximal Even Girth
• Quasi-random graphs

This page was built for publication: More about sparse halves in triangle-free graphs