Abstract
AbstractIn this paper, we investigate the minimum number of triangles, denoted by , in ‐vertex ‐regular graphs, where is an odd integer and is an even integer. The well‐known Andrásfai–Erdős–Sós Theorem has established that if . In a striking work, Lo has provided the exact value of for sufficiently large , given that . Here, we bridge the gap between the aforementioned results by determining the precise value of in the entire range . This confirms a conjecture of Cambie, de Joannis de Verclos, and Kang for sufficiently large .
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.
