Publication date
April 1996
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractWe determine all homogenous linear inequalities satisfied by the numbers of occurrences of the two largest distances among n points in the plane
AbstractWe determine all homogenous linear inequalities satisfied by the numbers of occurrences of the two largest distances among n points in the plane
International audienceOn any proper convex domain in real projective space there exists a natural Ri...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
AbstractWe answer the following question posed by Paul Erdős and George Purdy: determine the...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points....
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...
AbstractWhat is the maximum number of unit distances between the vertices of a convex n-gon in the p...
AbstractWe present a short proof of Z. Füredi's theorem (1990, J. Combin. Theory Ser. A55, 316–320) ...
AbstractWe study the problems of the maximum numbers of unit distances, largest distances and smalle...
AbstractTheorem. (A) For equal numbers of black and white points in euclidean space the sum of the p...
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is present...
Given a set P of n points in ℝd, let d1 > d2 >...denote all distinct inter-point distances gen...
Let P be a set of n>d points in Rd for d≥2. It was conjectured by Zvi Schur that the maximum number ...
AbstractLet G be an infinite graph decomposing the plane into polygonal regions. We assume that ther...
We establish the following result related to Erdős’s problem on distinct distances. Let V be an n-el...
International audienceOn any proper convex domain in real projective space there exists a natural Ri...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
AbstractWe answer the following question posed by Paul Erdős and George Purdy: determine the...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points....
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...
AbstractWhat is the maximum number of unit distances between the vertices of a convex n-gon in the p...
AbstractWe present a short proof of Z. Füredi's theorem (1990, J. Combin. Theory Ser. A55, 316–320) ...
AbstractWe study the problems of the maximum numbers of unit distances, largest distances and smalle...
AbstractTheorem. (A) For equal numbers of black and white points in euclidean space the sum of the p...
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is present...
Given a set P of n points in ℝd, let d1 > d2 >...denote all distinct inter-point distances gen...
Let P be a set of n>d points in Rd for d≥2. It was conjectured by Zvi Schur that the maximum number ...
AbstractLet G be an infinite graph decomposing the plane into polygonal regions. We assume that ther...
We establish the following result related to Erdős’s problem on distinct distances. Let V be an n-el...
International audienceOn any proper convex domain in real projective space there exists a natural Ri...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
AbstractWe answer the following question posed by Paul Erdős and George Purdy: determine the...
Add to ORKG