Locally finite graphs and their localization numbers
Journal of Combinatorics · 2026 · 17 (4) · 467-481
DOI: 10.4310/joc.260511225802 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorics, 2026. Verfasst von Anthony Bonato und 3 weiteren Autor:innen.
Abstract (Originalsprache)
We study the Localization game on locally finite graphs trees, where each of the countably many vertices have finite degree. In contrast to the finite case, we construct a locally finite tree with localization number $n$ for any choice of positive integer $n$. Our examples have uncountably many ends, and we show that this is necessary by proving that locally finite trees with finitely or countably many ends have localization number at most 2. Finally, as is the case for finite graphs, we prove that any locally finite graph contains a subdivision where one cop can capture the robber.
Zitieren
APA
Bonato, A., Lehner, F., Marbach, T. G., & Nir, J. (2026). Locally finite graphs and their localization numbers. Journal of Combinatorics, 17(4), 467-481. https://doi.org/10.4310/joc.260511225802
Vancouver
Bonato A, Lehner F, Marbach TG, Nir J. Locally finite graphs and their localization numbers. Journal of Combinatorics. 2026;17(4):467-481. doi:10.4310/joc.260511225802
BibTeX
@article{Bonato2026,
author = {Bonato, Anthony and Lehner, Florian and Marbach, Trent G. and Nir, JD},
title = {Locally finite graphs and their localization numbers},
journal = {Journal of Combinatorics},
year = {2026},
volume = {17},
number = {4},
pages = {467--481},
doi = {10.4310/joc.260511225802}
}
EUVIMED