Author:
LIU HONG,PIKHURKO OLEG,STADEN KATHERINE
Abstract
What is the minimum number of triangles in a graph of given order and size? Motivated by earlier results of Mantel and Turán, Rademacher solved the first nontrivial case of this problem in 1941. The problem was revived by Erdős in 1955; it is now known as the Erdős–Rademacher problem. After attracting much attention, it was solved asymptotically in a major breakthrough by Razborov in 2008. In this paper, we provide an exact solution for all large graphs whose edge density is bounded away from
$1$
, which in this range confirms a conjecture of Lovász and Simonovits from 1975. Furthermore, we give a description of the extremal graphs.
Publisher
Cambridge University Press (CUP)
Subject
Discrete Mathematics and Combinatorics,Geometry and Topology,Mathematical Physics,Statistics and Probability,Algebra and Number Theory,Analysis
Reference42 articles.
1. [41] Szegedy, B. , ‘An information theoretic approach to Sidorenko’s conjecture’, Preprint, 2014, arXiv:1406.6738v3.
2. The clique density theorem
3. A correlation inequality for bipartite graphs
4. On the Minimal Density of Triangles in Graphs
5. Flag algebras
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The feasible region of induced graphs;Journal of Combinatorial Theory, Series B;2023-01
2. An Interview with Alexander Razborov;The Mathematical Intelligencer;2022-06-06
3. Combinatorics;Landscape of 21st Century Mathematics;2021
4. Asymptotic Structure for the Clique Density Theorem;discrete Analysis;2020-12-30
5. Sharp bounds for decomposing graphs into edges and triangles;Combinatorics, Probability and Computing;2020-10-12