论文标题
$ 2K_2 $ - 免费图形的警察和强盗
Cops and robbers on $2K_2$-free graphs
论文作者
论文摘要
我们证明，任何$ 2K_2 $ Free Graph的COP号最多都是2，证明了Sivaraman和Testa的猜想。我们还表明，COP的上限为$ 3 $的$ 2K_1+K_2 $ -FREE（co-Diamond-免费）图形是最好的。
We prove that the cop number of any $2K_2$-free graph is at most 2, proving a conjecture of Sivaraman and Testa. We also show that the upper bound of $3$ on the cop number of $2K_1+K_2$-free (co-diamond--free) graphs is best possible.
