Work

What Fraction of the Vertex Set of a Graph can be Covered by $k$ Neighborhoods?

Year: 2026
Type: article
Abstract: Let $k\ge 2$ be a fixed integer, $0<c<1$ a constant. Consider a graph $G$ with $n$ vertices and average degree $cn$. We answer a question of Simon Griffiths by showing that $G$ has $k$ vertices such that their neighborhoods together cover at least $\min\bigl(1-(1-c)^{k},\sqrt{c}\,\bigr)n$ vertices. This result is essentially tight.
Author: Janos Pach
Language: English
Open Access status: diamond
OpenAlex ID: W7159624449
FWCI:
Cites: 3
Cited by:
Related to: 10