Back to Search
Start Over
Asymptotic Structure for the Clique Density Theorem
- Source :
- Discrete Analysis, 2020:19, 26pp
- Publication Year :
- 2019
-
Abstract
- The famous Erd\H{o}s-Rademacher problem asks for the smallest number of $r$-cliques in a graph with the given number of vertices and edges. Despite decades of active attempts, the asymptotic value of this extremal function for all $r$ was determined only recently, by Reiher [Annals of Mathematics, 184 (2016) 683--707]. Here we describe the asymptotic structure of all almost extremal graphs. This task for $r=3$ was previously accomplished by Pikhurko and Razborov [Combinatorics, Probability and Computing, 26 (2017) 138--160].
- Subjects :
- Mathematics - Combinatorics
05C35
Subjects
Details
- Database :
- arXiv
- Journal :
- Discrete Analysis, 2020:19, 26pp
- Publication Type :
- Report
- Accession number :
- edsarx.1906.05942
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.19086/da.18559