Improved bounds on the cop number when forbidding a minor

Franklin Kenter, Erin Meger, Jérémie Turcotte

Andreae (1986) proved that the cop number of connected $H$-minor-free graphs is bounded for every graph $H$. In particular, the cop number is at most $|E(H-h)|$ if $H-h$ contains n…