论文标题
4-pop冠军图至少有19个顶点
4-cop-win graphs have at least 19 vertices
论文作者
论文摘要
我们表明，最多3个或更少的顶点上的任何图表的COP数量。这回答了Andreae于1986年提出的一个问题，以及Baird等人最近提出的问题。我们还在11个顶点上找到了所有3台冠军的图形，缩小了19个顶点上可能的4-Cop-win图，并在找到3-Cop Win Planar图的最小顺序方面取得了一些进展。
We show that the cop number of any graph on 18 or fewer vertices is at most 3. This answers a question posed by Andreae in 1986, as well as more recently by Baird et al. We also find all 3-cop-win graphs on 11 vertices, narrow down the possible 4-cop-win graphs on 19 vertices and make some progress on finding the minimum order of 3-cop-win planar graphs.
