不含爪图或叉图的无$P_k$图的警察数
Cop number of $P_k$-free graphs without a claw or a fork
AI总结:
本文改进了Clow等人关于无$P_k$的爪图、叉图的警察数结果,给出更优上界,还证明不含$(P_7, fork)$图的警察数上界为3且该界紧。
摘要:
2019年,Liu证明了任何不含$(P_k, claw)$图的警察数至多为$k-3$。2026年,Clow和Meger改进并推广了Liu的结果,证明每个连通的不含$(P_k, E)$图的警察数至多为$\frac{k-1}{2}$向上取整加3,其中图$E$是通过细分爪图的两条边得到的。本文证明每个不含$(P_k, claw)$图$G$的警察数至多为$\frac{k-1}{2}$向上取整,这改进了Clow和Meger关于不含爪图的结果;进一步证明当$G$包含长度至少为$k-1$的洞时,该界可改进为$\frac{k}{3}$向上取整。还证明每个不含$(P_k, fork)$图的警察数至多为$\frac{2(k-1)}{3}$向上取整,对部分$k$值也改进了Clow和Meger关于不含叉图的结果;此外证明每个不含$(P_7, fork)$图的警察数至多为3,且该界是紧的。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。