Abstract
One of Erdős’s conjectures states that every triangle-free graph on vertices has an induced subgraph on vertices with at most edges. We report several partial results towards this conjecture. In particular, we establish the new bound on the number of edges in the general case. We completely prove the conjecture for graphs of girth , for graphs with independence number and for strongly regular graphs. Each of these three classes includes both known (conjectured) extremal configurations, the 5-cycle and the Petersen graph. Bibliography: 21 titles.
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.
