Let $x_1, x_2, \dots, x_n$ be a set of diameter one in the plane. Prove that the maximum number of pairs of points at distance greater than $1/\sqrt{2}$ is $\lfloor n^2/3\rfloor$.
Posted: Jun 17 '12
Seen: 26 times
Last updated: Jun 17 '12
Characterizing outerplanar graphs
Recognizing series-parallel graphs in linear time
Halin's theorem and Mader's theorem
The cube of a connected graph is hamiltonian