Meyniel’s conjecture on the cop number: A survey

@article{Baird2012MeynielsCO,
  title={Meyniel’s conjecture on the cop number: A survey},
  author={William Baird and Anthony Bonato},
  journal={The Journal of Combinatorics},
  year={2012},
  volume={3},
  pages={225-238}
}
Meyniel’s conjecture is one of the deepest open problems on the cop number of a graph. It states that for a connected graph G of order n, c(G) = O( √ n). While largely ignored for over 20 years, the conjecture is receiving increasing attention. We survey the origins of and recent developments towards the solution of the conjecture. We present some new results on Meyniel extremal families containing graphs of order n satisfying c(G) ≥ d√n, where d is a constant. 

Figures from this paper

Topological directions in Cops and Robbers
TLDR
This work surveys results at the intersection of topological graph theory and the game of Cops and Robbers, focusing on results, conjectures, and open problems for the cop number of a graph embedded on a surface, and considers graphs of higher genus. Expand
Cops and Robbers on Graphs Based on Designs
We investigate the cop number of graphs based on combinatorial designs. Incidence graphs, point graphs, and block intersection graphs are studied, with an emphasis on finding families of graphs withExpand
Meyniel Extremal Families of Abelian Cayley Graphs
We study the game of Cops and Robbers, where cops try to capture a robber on the vertices of a graph. Meyniel's conjecture states that for every connected graph $G$ on $n$ vertices, the cop number ofExpand
Conjectures on Cops and Robbers
We consider some of the most important conjectures in the study of the game of Cops and Robbers and the cop number of a graph. The conjectures touch on diverse areas such as algorithmic, topological,Expand
Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory
In this dissertation, we treat several problems in Ramsey theory, probabilistic combinatorics and extremal graph theory. We begin with the Ramsey theoretic problem of finding exactly m-colouredExpand
Cops and Robbers on Planar-Directed Graphs
TLDR
A geometric construction is exhibited which shows that a more sophisticated robber strategy can indefinitely evade three cops on a particular strongly connected planar directed graph. Expand
Hyperopic Cops and Robbers
We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the correspondingExpand
Lazy Cops and Robbers played on random graphs and graphs on surfaces
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. The lazy cop number is the analogue of the usual cop number for thisExpand
CATCH ME IF YOU CAN: COPS AND ROBBERS ON GRAPHS
Vertex pursuit games are widely studied by both graph theorists and computer scientists. Cops and Robbers is a vertex pursuit game played on a graph, where some set of agents (or Cops) attempts toExpand
On the cop number of graphs of high girth
TLDR
It is shown that the "weak" Meyniel's conjecture holds for expander graph families of bounded degree and that the cop number of any graph with girth $g$ and minimum degree $\delta$ is at least $\tfrac{1}{g}(\delta - 1)^{\lfloor g-1}{4}\rfloor}$. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 50 REFERENCES
On Meyniel's conjecture of the cop number
TLDR
This article proves Meyniel's conjecture in special cases that G has diameter 2 or G is a bipartite graph of diameter 3, improving the best previously known upper-bound O(n/ lnn) due to Chiniforooshan. Expand
Cops and Robbers on Graphs Based on Designs
We investigate the cop number of graphs based on combinatorial designs. Incidence graphs, point graphs, and block intersection graphs are studied, with an emphasis on finding families of graphs withExpand
Note on a pursuit game played on graphs
TLDR
A negative answer to the question if it is true that c(G) ≤ k whenever the maximal degree of G is at most k is given by showing that, for all positive integers k, n (k ≥ 3), there exists a k-regular graph G with c( G) ≥ n. Expand
A Bound for the Cops and Robbers Problem
TLDR
Improving several previous results, it is proved that the cop number of an n-vertex graph is at most n2 −ð1 þoð1ÞÞ ffiffiffiffIFFiffiffiffsiffiffi log n p . Expand
When does a random graph have constant cop number?
TLDR
Asymptotic results for the game of Cops and Robbers played on a random graph G(n, p) focusing on the case when the cop number does not grow with the size of a graph are presented. Expand
Variations on cops and robbers
TLDR
The directed graph version of the classical Cops and Robbers game is studied, and it is shown that the cop number of any strongly connected digraph on n vertices is O(n(loglogn)2/logn). Expand
On a pursuit game played on graphs for which a minor is excluded
  • Thomas Andreae
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1986
TLDR
An upper bound for c(G) is established in terms of the cross-cap number of G, thus providing a (partial) analogue to a result of Quilliot on the genus. Expand
Cops and robbers in a random graph
TLDR
It is proved that for sparse random graphs the cop-number has order of magnitude n^1/^2^+^o^(^1^) cops, and it is shown that, for general graphs, this strategy cannot be too effective: there are graphs that need at least n^2/3/4/5 cops for this strategy. Expand
A short note about pursuit games played on a graph with a given genus
  • A. Quilliot
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1985
TLDR
This result is extended, showing that if G is a graph with a given genus k, then 3 + 2k pursuers are enough to “arrest” the evader B. Expand
Cops and robbers in graphs with large girth and Cayley graphs
  • P. Frankl
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1987
Abstract It is shown that if a graph has girth at least 8 t −3 and minimum degree greater that d , then more than d t cops are needed to catch a robber. Some upper bounds, in particular for CayleyExpand
...
1
2
3
4
5
...