Answers are grounded in this paper and cite their sources.
Let k≥ 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(1-(1-c)ᵏ,√c\,)n vertices. This result is essentially tight.
No takes yet. Share an insight, caveat, or question.
János Pach (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: