Cops and robbers on $2K_2$-free graphs
Combinatorics
2025-10-29 v2 Discrete Mathematics
Abstract
We prove that the cop number of any -free graph is at most 2, proving a conjecture of Sivaraman and Testa. We also show that the upper bound of on the cop number of -free (co-diamond--free) graphs is best possible.
Keywords
Cite
@article{arxiv.2001.03124,
title = {Cops and robbers on $2K_2$-free graphs},
author = {Jérémie Turcotte},
journal= {arXiv preprint arXiv:2001.03124},
year = {2025}
}
Comments
10 pages, 1 figure