A question of the following kind will concern us here: what is the minimal number n, ensuring that any spanning set of n points in 3-space spans a plane, every open side of which contains at least. say, 1000 points of the set. The answer is n = 4001 (see Theorem 2.1 below).