Metraipolis › archive › dc_5fed2466d7ca
Cop number of $P_k$-free graphs without a claw or a fork — arXiv:2610.20129
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20129
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T21:52:45.652Z
- SHA-256 of the archived text
332bd94b1f55a51b200de185589d82c5a467e27293c40ddebb0991e3a0149720- Stable URL of this page
https://metraipolis.com/documento/dc_5fed2466d7ca
How to cite
Cop number of $P_k$-free graphs without a claw or a fork — arXiv:2610.20129 — arXiv (en), https://arxiv.org/abs/2610.20129 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5fed2466d7ca (Metraipolis archive dc_5fed2466d7ca, sha256 332bd94b1f55a51b200de185589d82c5a467e27293c40ddebb0991e3a0149720)
BibTeX
@misc{dc5fed2466d7ca,
title = {Cop number of $P_k$-free graphs without a claw or a fork — arXiv:2610.20129},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20129},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5fed2466d7ca; sha256 332bd94b1f55a51b200de185589d82c5a467e27293c40ddebb0991e3a0149720},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20129. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In 2019, Liu proved that the cop number of any $(P_k, claw)$-free graph is at most $k-3$. In 2026, Clow and Meger improved and generalized the result of Liu by showing that every connected $(P_k, E)$-free graph has cop number at most $\lceil \frac{k-1}{2} \rceil + 3$, where the graph $E$ is obtained by subdividing two edges of a claw. In this paper, we show that every $(P_k, claw)$-free graph $G$ has cop number at most $\lceil \frac{k-1}{2} \rceil$. This improves the result of Clow and Meger on claw-free graphs. We further show that this bound can be improved to $\lceil \frac{k}{3}\rceil$, when $G$ contains a hole of length at least $k-1$. We show that the cop number of any $(P_k, fork)$-free graph is at most $\lceil \frac{2(k-1)}{3} \rceil$. This also improves the result of Clow and Meger on fork-free graphs for some values of $k$. We further show that every $(P_7, fork)$-free graph has cop number at most $3$, and this bound is tight.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.20129 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T21:37:14.433Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).