Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cops and robbers in random graphs   We consider the pursuit and evasion game on finite, connected, undirected
graphs known as cops and robbers. Meyniel conjectured that for every graph on n
vertices a rootish number of cops can win the game. We prove that this holds up
to a log(n) factor for random graphs G(n,p) if p is not very small, and this is
close to be tight unless the graph is very dense. We analyze the area-defending
strategy (used by Aigner in case of planar graphs) and show examples where it
can not be too efficient.

17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
1
The categories of this paper are: cs
20
The categories of this paper are: acc-phys
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
30
The categories of this paper are: q-alg