1 paper · 1 filter
Prosenjit Bose, Louis Esperet, Jędrzej Hodor +3
Meyniel's conjecture states that n-vertex connected graphs have cop number O(n). The current best known upper bound is n/2(1−o(1))logn, proved independentl…