Crossref
What Fraction of the Vertex Set of a Graph can be Covered by $k$ Neighborhoods?
The Electronic Journal of Combinatorics · 20.11.2026 · 33 (4)
DOI: 10.37236/15672 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 20.11.2026. Verfasst von Janos Pach.
Abstract (Originalsprache)
Let $k\ge 2$ be a fixed integer, $0
Zitieren
APA
Pach, J. (2026). What Fraction of the Vertex Set of a Graph can be Covered by $k$ Neighborhoods?. The Electronic Journal of Combinatorics, 33(4). https://doi.org/10.37236/15672
Vancouver
Pach J. What Fraction of the Vertex Set of a Graph can be Covered by $k$ Neighborhoods?. The Electronic Journal of Combinatorics. 2026;33(4). doi:10.37236/15672
BibTeX
@article{Pach2026,
author = {Pach, Janos},
title = {What Fraction of the Vertex Set of a Graph can be Covered by $k$ Neighborhoods?},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {4},
doi = {10.37236/15672}
}
EUVIMED