Detecting a long odd hole
Combinatorics
2020-09-08 v2
Abstract
For each integer , we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least and odd.
Cite
@article{arxiv.1904.12273,
title = {Detecting a long odd hole},
author = {Maria Chudnovsky and Alex Scott and Paul Seymour},
journal= {arXiv preprint arXiv:1904.12273},
year = {2020}
}