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

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.

Authors

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-11-20
DOI
https://doi.org/10.37236/15672
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

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

János Pach
The Electronic Journal of Combinatorics
Limits and Structures in Graph Theory
article

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

János Pach
article en

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.

The Electronic Journal of CombinatoricsVol. 33(4)
Academia Sinica, Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon