arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.11484math.COcs.DM
收藏

无$2K_2$图的Cop数

Cop number of $2K_2$-free graphs

Vaidy Sivaraman, Stephen Testa

摘要:

证明了无$2K_2$图的copnumber至多为$2$,如果它有直径$3$或没有长度为$k$的诱导圈,其中$k \ \in \{3,4,5\}$ .我们猜想每个无$2K_2$的图的copnumber至多是$2$ .

英文摘要:

We prove that the cop number of a $2K_2$-free graph is at most $2$ if it has diameter $3$ or does not have an induced cycle of length $k$, where $k \ \in \{3,4,5\}$. We conjecture that the cop number of every $2K_2$-free graph is at most $2$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑