Abstract
We show that a K 4-free graph with e edges has at most (e⧸3) 3 2 triangles. This supercedes a bound of Moon and Moser and is strict when e = 3 n 2 for any whole number n.
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.
