Abstract
For each integer ℓ ≥ 5, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least ℓ and odd.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. BERGER, P. SEYMOUR and S. SPIRKL: Finding an induced path that is not a shortest path, submitted for publication, arXiv:2005.12861.
D. BIENSTOCK: On the complexity of testing for odd holes and induced odd paths, Discrete Math. 90 (1991), 85–92.
D. BIENSTOCK: Corrigendum: On the complexity of testing for odd holes and induced odd paths, Discrete Math. 102 (1992), 109.
M. CHUDNOVSKY, G. CORNUÉJOLS, X. LIU, P. SEYMOUR and K. VUŠKOVIĆ: Recognizing Berge graphs, Combinatorica 25 (2005), 143–186.
M. CHUDNOVSKY, A. SCOTT and P. SEYMOUR: Finding a shortest odd hole, submitted for publication, arXiv:2004.11874.
M. CHUDNOVSKY, A. SCOTT, P. SEYMOUR and S. SPIRKL: Detecting an odd hole, J. Assoc. Comput. Mach. 67 (2020), 1–12.
M. CHUDNOVSKY, A. SCOTT, P. SEYMOUR and S. SPIRKL: Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes, J. Combinatorial Theory, Ser. B 140 (2020), 84–97, arXiv:1701.07217.
M. CHUDNOVSKY, A. SCOTT, P. SEYMOUR and S. SPIRKL: Proof of the Kalai-Meshulam conjecture, Israel J. Math., 238 (2020), 639–661, arXiv:1810.00065.
L. COOK and P. SEYMOUR: Detecting a long even hole, submitted for publication, arXiv:2009.05691.
K. LAI, H. LU and M. THORUP: Three-in-a-tree in near linear time, Proc. 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, 1279–1292.
A. SCOTT and P. SEYMOUR: Induced subgraphs of graphs with large chromatic number. I. Odd holes, J. Combinatorial Theory, Ser. B 121 (2016), 68–84.
A. SCOTT and P. SEYMOUR: Induced subgraphs of graphs with large chromatic number. X. Holes with specific residue, Combinatorica 39 (2019), 1105–1132, arXiv:1705.04609.
Acknowledgement
We would like to thank Hou Teng Cheong, who found a significant error in an earlier version of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
This material is based upon work supported in part by the U. S. Army Research Office under grant number W911NF-16-1-0404, and by NSF grant DMS-1763817.
Supported by a Leverhulme Trust Research Fellowship.
Supported by NSF grant DMS-1800053 and AFOSR grant A9550-19-1-0187, and partially supported by the Simons Foundation and by the Mathematisches Forschungsinstitut Oberwolfach.
