Abstract
AbstractWe consider the minimum degree stability of graphs forbidding odd cycles: What is the tight bound on the minimum degree to guarantee that the structure of a ‐free graph inherits from the extremal graph (a balanced complete bipartite graph)? Andrásfai, Erdős, and Sós showed that if a ‐free graph on vertices has minimum degree greater than , then it is bipartite. Häggkvist showed that for , if a ‐free graph on vertices has minimum degree greater than , then it is bipartite. Häggkvist also pointed out that this result cannot be extended to . In this paper, we give a complete answer for any . We show that if and is an ‐vertex ‐free graph with , then is bipartite, and the bound is tight.
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.
