DOIAbstract
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points in the Euclidean plane. We prove that n2⩽32n for arbitrary set S. This upper bound is sharp
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points in the Euclidean plane. We prove that n2⩽32n for arbitrary set S. This upper bound is sharp
We prove that a well-distributed subset of R 2 can have a distance set ∆ with #( ∆ ∩ [0, N]) ≤ CN ...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points ...
AbstractWe determine all homogenous linear inequalities satisfied by the numbers of occurrences of t...
We answer the following question posed by Paul Erd"os and George Purdy: determine the large...
AbstractWhat is the maximum number of unit distances between the vertices of a convex n-gon in the p...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points....
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
AbstractWe prove that among n points in the plane in general position, the shortest distance can occ...
Dedicated to János Pach on the occasion of his 50-th birthday. Given a set P of n points in convex ...
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is present...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
Abstract. It is studied the problem of the maximum number of points situated on a hypersphere of rad...
AbstractWe answer the following question posed by Paul Erdős and George Purdy: determine the...
We prove that a well-distributed subset of R 2 can have a distance set ∆ with #( ∆ ∩ [0, N]) ≤ CN ...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points ...
AbstractWe determine all homogenous linear inequalities satisfied by the numbers of occurrences of t...
We answer the following question posed by Paul Erd"os and George Purdy: determine the large...
AbstractWhat is the maximum number of unit distances between the vertices of a convex n-gon in the p...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points....
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
AbstractWe prove that among n points in the plane in general position, the shortest distance can occ...
Dedicated to János Pach on the occasion of his 50-th birthday. Given a set P of n points in convex ...
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is present...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
Abstract. It is studied the problem of the maximum number of points situated on a hypersphere of rad...
AbstractWe answer the following question posed by Paul Erdős and George Purdy: determine the...
We prove that a well-distributed subset of R 2 can have a distance set ∆ with #( ∆ ∩ [0, N]) ≤ CN ...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
Add to ORKG