We study some discrete and continuous variants of the following problem of Erdos: Given a finite subset P of R^2, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 - p_2| = 1?
Tuesday, February 4, 2014 - 4:30pm
FSU
We study some discrete and continuous variants of the following problem of Erdos: Given a finite subset P of R^2, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 - p_2| = 1?