ELMO SL 2011 C6

Do there exist positive integers $k$ and $n$ such that for any finite graph $G$ with diameter $k+1$ there exists a set $S$ of at most $n$ vertices such that for any $v\in V(G)\setminus S$ , there exists a vertex $u\in S$ of distance at most $k$ from $v$ ?

David Yang.