论文信息 - Popular distances in 3-space

Popular distances in 3-space

Let m(n) denote the smallest integer m with the property that any set of n points in Euclidean 3-space has an element such that at most m other elements are equidistant from it. We have that cn1/3 log log n ⩽ m(n) ⩽ n3/5 β(n), where c > 0 is a constant and β(n) is an extremely slowly growing function, related to the inverse of the Ackermann function.

[1] Paul Erdös,et al. Repeated distances in space , 1988, Graphs Comb..

[2] Leonidas J. Guibas,et al. Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[3] P Erd,et al. On Sets of Distances of N Points in Euclidean Space , 2022 .

[4] Miklós Simonovits,et al. Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures , 1984, Discret. Math..

[5] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .

[6] János Pach,et al. Combinatorial Geometry , 2012 .

[7] Miklós Simonovits,et al. INVERSE EXTREMAL DIGRAPH PROBLEMS , 1984 .

[8] Paul Erdös,et al. Variations on the theme of repeated distances , 1990, Comb..

[9] P. Erdös. On Sets of Distances of n Points , 1946 .