erdos_distinct_distances_problem (378B)
1 # Erdos distinct distances problem 2 3 https://en.wikipedia.org/wiki/Erd%C5%91s_distinct_distances_problem 4 5 A question about the minimal number of distinct edge distances can be achieved by a planar embedding of a graph (the maximal number is easy to achieve) 6 7 Known to be Omega(n / log n) and O(n / sqrt(log n)) 8 9 See also: [unit_distance_conjecture] 10 11 Up: [extremal_combinatorics]