Abstract
It is proved that for every constant ϵ > 0 and every graph G on n vertices which contains no odd cycles of length smaller than ϵn, G can be made bipartite by removing (15/ϵ)ln(10/ϵ)) vertices. This result is best possible except for a constant factor. Moreover, it is shown that one candestroy all odd cycles in such a graph G also by omitting not more than (200/ ϵ 2)(ln(10/ ϵ)) 2 edges.
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.
