4-cop-win graphs have at least 19 vertices
arXiv:2006.02998 · doi:10.1016/j.dam.2021.05.012
Abstract
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.
31 pages, 9 figures. Data and code available at https://www.jeremieturcotte.com/research/min4cops/