Localization Capture Time Conjecture

• The Localization Capture Time Conjecture is a graph theory conjecture that postulates a linear upper bound on the number of rounds needed to capture an invisible robber using distance probes.
• It employs strategic graph decompositions, utilizing parameters like localization number, treewidth, and block structure to confine the robber's movement in various graph families.
• The conjecture bridges pursuit–evasion dynamics with structural graph theory and metric dimensions, prompting open questions on optimal constants and extension to broader graph classes.

Searching arXiv for papers on the graph-theoretic Localization Capture Time Conjecture. The Localization Capture Time Conjecture is a conjecture in the graph-theoretic localization game, a pursuit–evasion model in which an invisible robber moves on a connected graph while cops probe vertices and receive graph-distance information. In this setting, the central parameters are the localization number $\zeta(G)$, the minimum number of cops needed to force eventual identification of the robber, and the localization capture time, the minimum number of rounds required under optimal play. The conjecture, proposed by Behague et al. in 2022, asserts that there exists a constant $C$ such that every connected $n$-vertex graph $G$ satisfies $\lcapt(G)\le Cn$; equivalently, one may ask whether even $\lcapt(G)\le n$ always holds (Chenoweth et al., 14 Aug 2025). It is framed as the localization analogue of Meyniel’s conjecture for ordinary Cops and Robber capture time and connects distance-probing games to structural graph theory, metric dimension, and pursuit–evasion (Chenoweth et al., 14 Aug 2025).

1. Formal game model and core parameters

Let $G=(V,E)$ be a finite, connected graph. In the localization game, two players control an invisible robber and $k$ cops. The robber first chooses a start-vertex $r_0\in V$. In each round $t=1,2,\dots$, the cops simultaneously choose probe vertices $C$0, and receive the distance vector

$C$1

where $C$2 denotes graph distance. The robber then optionally moves along one edge or stays put, producing a new position $C$3. The cops win if, after some round $C$4, the distances observed force the robber’s location to be a single vertex; the robber wins by avoiding capture forever. The standard assumption is that the robber is omniscient and knows the cops’ strategy (Chenoweth et al., 14 Aug 2025).

The localization number $C$5 is the minimum $C$6 for which $C$7 cops have a winning strategy. For $C$8, the $C$9-localization capture time $n$0 is the minimum number of rounds in which $n$1 cops can force a win against a best-play robber, and the localization capture time is

$n$2

An earlier formulation uses the notation $n$3 and $n$4 for the same capture-time concept (Behague et al., 2021). The conjectural statement is therefore asymptotic in the graph order and concerns optimal play with the minimum number of cops.

The conjecture is motivated by the absence of known counterexamples with superlinear capture time. In the 2021 formulation, this was summarized as the empirical observation that no graph is known whose capture time exceeds a constant multiple of its order (Behague et al., 2021). This suggests that the problem is not merely one of existence of winning strategies, but of quantitative efficiency.

2. Origin and significance of the conjecture

The explicit conjecture appears in the form: there exists a constant $n$5 such that for every $n$6-vertex graph $n$7,

$n$8

or equivalently,

$n$9

depending on notation (Behague et al., 2021, Chenoweth et al., 14 Aug 2025). In the later account, Behague et al. are identified as having proposed the conjecture in 2022 (Chenoweth et al., 14 Aug 2025).

Its significance is twofold. First, a positive answer would complete, in the localization model, the analogue of Meyniel’s conjecture for ordinary Cops and Robber capture time (Chenoweth et al., 14 Aug 2025). Second, the conjecture places metric information at the center of pursuit–evasion: the cops do not occupy blocking positions but instead accumulate distance constraints, so proofs typically combine decomposition arguments, metric distinguishability, and monotonic shrinking of candidate sets.

A common misconception is to conflate the conjecture with bounds on the localization number alone. The conjecture does not assert that $G$0 is linear in $G$1; it asserts that once the minimum winning number of cops is available, the number of rounds required to force localization is $G$2. This distinction is visible in planar graphs, where $G$3 is unbounded and the capture-time conjecture is described as wide open (Chenoweth et al., 14 Aug 2025). Thus bounded or exactly known localization number is often a prerequisite for current capture-time techniques, but not itself the conjectural conclusion.

3. Established graph families and baseline bounds

The earliest broad evidence came from trees and interval graphs. For trees, it is known that $G$4 for every tree $G$5, and the 2021 result shows directly that if $G$6 is a tree of order $G$7, then $G$8; hence trees satisfy the conjecture (Behague et al., 2021). The proof sketch separates the cases $G$9 and $\lcapt(G)\le Cn$0: in the former, Seager’s one-cop strategy isolates the robber in at most $\lcapt(G)\le Cn$1 probes, and in the latter, one cop remains at a root while the second probes branches, with each round eliminating at least one vertex (Behague et al., 2021).

For interval graphs, the same paper states that $\lcapt(G)\le Cn$2 and $\lcapt(G)\le Cn$3 (Behague et al., 2021). The strategy follows an optimal path decomposition, using $\lcapt(G)\le Cn$4 cops to occupy all vertices except one in each bag successively, preventing the robber from backtracking.

The later survey of known bounds identifies several additional classes. For trees, Behague et al. had previously given $\lcapt(G)\le Cn$5 if $\lcapt(G)\le Cn$6 and $\lcapt(G)\le Cn$7 if $\lcapt(G)\le Cn$8 (Chenoweth et al., 14 Aug 2025). For outerplanar graphs, Bonato–Kinnersley proved $\lcapt(G)\le Cn$9 for all outerplanar $\lcapt(G)\le n$0, and Behague et al. deduced $\lcapt(G)\le n$1 when $\lcapt(G)\le n$2 (Chenoweth et al., 14 Aug 2025). Interval graphs and complete multipartite graphs satisfy $\lcapt(G)\le n$3 or $\lcapt(G)\le n$4, and for diameter-2 graphs some exact values are known (Chenoweth et al., 14 Aug 2025).

The 2021 paper also develops bounds for incidence graphs of projective planes and for general graphs via treewidth (Behague et al., 2021). If $\lcapt(G)\le n$5 is the incidence graph of a projective plane of order $\lcapt(G)\le n$6, then with $\lcapt(G)\le n$7,

$\lcapt(G)\le n$8

and in particular for $\lcapt(G)\le n$9,

$G=(V,E)$0

so $G=(V,E)$1 (Behague et al., 2021). Since this is sublinear in $G=(V,E)$2, it is consistent with the conjecture and shows that capture time can be substantially smaller than linear in structured families.

4. Improved bounds for trees

A major advance is given in “Localization game capture time of trees and outerplanar graphs” (Chenoweth et al., 14 Aug 2025). Let $G=(V,E)$3 be a tree on $G=(V,E)$4 vertices and let $G=(V,E)$5 be its number of leaves. The paper proves two refined theorems.

If $G=(V,E)$6, equivalently $G=(V,E)$7 contains no $G=(V,E)$8, then

$G=(V,E)$9

If $k$0, so $k$1 contains $k$2, then

$k$3

Consequently, in all cases,

$k$4

These results significantly improve the previously known upper bounds for trees (Chenoweth et al., 14 Aug 2025).

The proof outlines are structurally informative. For $k$5, the tree is rooted at a leaf $k$6, and the single cop “drills down” one level by probing leaves or degree-2 children of the current root $k$7, using at most as many probes as leaves in the pruned branches. Two cases, according to whether the current root has at most one or exactly two high-degree children, allow elimination of all but one branch in at most $k$8 total probes (Chenoweth et al., 14 Aug 2025).

For $k$9, the argument uses a pairing strategy of branches. In the first move, the cops eliminate all but three high-leaf branches around a $r_0\in V$0 core. Each subsequent probing discards at least two leaves from the candidate set, yielding capture in $r_0\in V$1 rounds (Chenoweth et al., 14 Aug 2025). This suggests that leaf count, rather than only total order, is the operative complexity parameter for trees.

The structural role of the “double-tripod” $r_0\in V$2 is also explicit. It characterizes the transition between one-cop and two-cop trees: it is classical that $r_0\in V$3 for every tree, and equality holds exactly when $r_0\in V$4 contains $r_0\in V$5 (Chenoweth et al., 14 Aug 2025). Thus the improved capture-time bounds refine not just the asymptotic estimate but the dependence on the tree’s branching geometry.

5. Outerplanar graphs and block-based strategies

Outerplanar graphs form a second principal test bed because their localization numbers are known exactly and their sparse structure permits explicit strategies (Chenoweth et al., 14 Aug 2025). Two results are stated for the case $r_0\in V$6.

For an arbitrary outerplanar graph whose blocks are $r_0\in V$7,

$r_0\in V$8

achieved by adding one new vertex of the cop-territory per round using the Bonato–Kinnersley strategy (Chenoweth et al., 14 Aug 2025). This gives a decomposition-sensitive bound in terms of the block structure.

For a 2-connected outerplanar graph with $r_0\in V$9 interior chords,

$t=1,2,\dots$0

The proof sketch labels the outer cycle $t=1,2,\dots$1 and probes midpoints of the longest induced cycle to confine the robber to an arc with fewer chords. Two endpoints $t=1,2,\dots$2 of the current cop territory are maintained, together with known distances $t=1,2,\dots$3. In each case, depending on whether $t=1,2,\dots$4 and $t=1,2,\dots$5 share a neighbor, one chord is discarded per probe by comparing distances and using inequalities of the form $t=1,2,\dots$6; since there are $t=1,2,\dots$7 chords, capture occurs in at most $t=1,2,\dots$8 rounds (Chenoweth et al., 14 Aug 2025).

These outerplanar results show that the conjectured linear bound is not merely a consequence of bounded order versus bounded cop number. The arguments are highly sensitive to graph decomposition: block-cut structure in general outerplanar graphs, and chord count in the 2-connected case. A plausible implication is that similar refinement by decomposition parameters may be necessary for broader sparse families such as bounded-treewidth graphs.

6. General frameworks: monotonicity, treewidth, and coloring structures

Beyond individual graph classes, the literature develops general-purpose frameworks for understanding capture time. One such result concerns monotonicity on induced subgraphs. In general, capture time need not be monotone under induced subgraphs, but it does hold for “special” induced subgraphs, defined by the condition that every path in $t=1,2,\dots$9 between two vertices of $C$00 is entirely contained in $C$01 (Behague et al., 2021). If $C$02 is special in $C$03, then for all $C$04,

$C$05

In particular, capture time is monotone on trees: if $C$06 is a subtree of $C$07, then for all $C$08,

$C$09

(Behague et al., 2021). The proof uses a retraction from $C$10 to $C$11 that preserves the informational content of probes.

A second line of attack uses treewidth and decomposition radius. If $C$12 is the treewidth, $C$13 the “tree-radius,” and an optimal decomposition has $C$14 leaves, then

$C$15

A complementary bound is

$C$16

(Behague et al., 2021). These are not direct proofs of the conjecture, because they use more than $C$17 cops, but they show that capture time can be controlled through structural width parameters.

The most abstract framework in the 2025 paper is a coloring-based generalization. Given colorings $C$18 of $C$19, one defines a layered “game structure” whose rows represent sets of vertices that can be the robber’s candidate position after $C$20 additional probes. Row 1 consists of all singletons. Row $C$21 consists of subsets $C$22 not yet listed whose closed neighborhood $C$23 can be distinguished by some coloring $C$24 into color-classes appearing in earlier rows (Chenoweth et al., 14 Aug 2025).

If $C$25 are the distance-colorings of $C$26 by all $C$27-subsets, then the height of the reduced game structure equals $C$28 (Chenoweth et al., 14 Aug 2025). In this interpretation, each probe is an application of a coloring, and the row number measures how many further probes suffice from a given candidate set. The paper emphasizes two gains: a unifying framework that does not refer to actual distances, and a route to the conjecture via purely combinatorial bounds on the number of rows as a function of $C$29 (Chenoweth et al., 14 Aug 2025).

An example result illustrates the perspective: for an arbitrary pair of colorings $C$30 on $C$31 vertices, the structure has at most $C$32 rows, because every row at least $C$33 must contain a size-2 set and row 2 already contains at least one pair (Chenoweth et al., 14 Aug 2025). This is not yet linear, but it recasts the conjecture as a combinatorial row-bound problem.

7. Open directions and current status

The current status is that the conjecture is confirmed for several graph families but remains open in full generality. Trees and interval graphs satisfy linear bounds (Behague et al., 2021), and the later work sharpens the tree bounds and proves the conjecture for a subclass of outerplanar graphs (Chenoweth et al., 14 Aug 2025). The tree and outerplanar results confirm $C$34 for these families (Chenoweth et al., 14 Aug 2025).

Several open directions are stated explicitly. One is to determine the optimal constant in the conjecture, or prove the stronger form with coefficient $C$35, namely whether $C$36 always holds (Behague et al., 2021, Chenoweth et al., 14 Aug 2025). Another is a “speed-up” question: for all $C$37, whether $C$38 (Behague et al., 2021). The 2025 paper further asks to extend the improved tree bound to arbitrary graphs of bounded treewidth, determine whether planar graphs with $C$39 are well-localizable, tighten the general coloring-based row-bound to linear in $C$40, and investigate trade-offs between $C$41 and $C$42 beyond metric-dimension (Chenoweth et al., 14 Aug 2025).

Planar graphs are a particularly important obstruction point. The available summary states that $C$43 is unbounded for planar graphs, so the capture-time conjecture is wide open there (Chenoweth et al., 14 Aug 2025). This does not refute the conjecture, but it indicates that methods relying on exact small localization number are unlikely to scale directly.

The coloring-structure program suggests a broader conceptual shift. If one can bound the height of reduced game structures linearly in $C$44, independently of geometric distance formulas, then the full conjecture would follow (Chenoweth et al., 14 Aug 2025). The expectation stated in the literature is that hybridizing structural decompositions, such as block-cut trees and tree-decompositions, with coloring-based game structures may yield further constant-factor improvements and perhaps ultimately prove $C$45 for all connected graphs (Chenoweth et al., 14 Aug 2025). This suggests that the conjecture sits at an interface between pursuit–evasion dynamics and purely combinatorial distinguishability.