A note on the localization number of random graphs: diameter two case

Abstract

We study the localization game on dense random graphs. In this game, a {\em cop} $x$ tries to locate a {\em robber} $y$ by asking for the graph distance of $y$ from every vertex in a sequence of sets $W_1,W_2,\dots ,W_{\ell }$. We prove high probability upper and lower bounds for the minimum size of each $W_i$ that will guarantee that $x$ will be able to locate $y$.

Corrects the proof of Lemma 2.9(ii)