Abstract
In the 1940s and 50s, Erdős and Rademacher raised the quantitative question of determining the number of triangles one can guarantee in a graph of given order and size. This problem has garnered much attention and, in a major breakthrough, was solved asymptotically by Razborov in 2008, whose results were extended by Nikiforov and Reiher. In this paper, we provide an exact solution for all large graphs whose edge density is bounded away from one. This proves almost every case of a conjecture of Lovász and Simonovits from 1975.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
