Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source: published paper, printed p. 221, Lemma 2.4.
Statement
A finite -separated has, for every , an -separated subset with
Full proof
Choose a remaining point, put it in , and remove all remaining points at distance at most from it. By Lemma 2.2, each step removes at most points, including the chosen point. Repeat until none remain. Distinct chosen points have distance greater than , and hence at least . The number of steps is at least .
In particular gives a -separated subset with , as needed in the main theorem.
Related proof pages. lemma 2 2.
Bears on. Problem 188.
Graph