Abstract

AbstractThe induced odd cycle packing number of a graph is the maximum integer such that contains an induced subgraph consisting of pairwise vertex‐disjoint odd cycles. Motivated by applications to geometric graphs, Bonamy et al. proved that graphs of bounded induced odd cycle packing number, bounded Vapnik–Chervonenkis (VC) dimension, and linear independence number admit a randomized efficient polynomial‐time approximation scheme for the independence number. We show that the assumption of bounded VC dimension is not necessary, exhibiting a randomized algorithm that for any integers and and any ‐vertex graph of induced odd cycle packing number at most returns in time an independent set of whose size is at least with high probability. In addition, we present ‐boundedness results for graphs with bounded odd cycle packing number, and use them to design a quasipolynomial‐time approximation scheme for the independence number only assuming bounded induced odd cycle packing number.

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 call

Disclaimer: 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.