AbstractHere we have an example for six points in the plane no three on a line no four on a circle, and no one equidistant from three others, such that they determine 5 distinct distances, one occurring once, one twice, one three times, one four times, and one five times, and the configuration does not contain equilateral triangles
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less ...
We show that for m points and n lines in R-2, the number of distinct distances between the points an...
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
Let p1, p2, p3 be three noncollinear points in the plane, and let P be a set of n other points in th...
AbstractThe question of how often the same distance can occur between k distinct points in n-dimensi...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
Abstract. In 1989, Erdős conjectured that for a sufficiently large n it is impossible to place n po...
We show that for m points and n lines in R2, the number of distinct distances between the points and...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractWe prove that among n points in the plane in general position, the shortest distance can occ...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less ...
We show that for m points and n lines in R-2, the number of distinct distances between the points an...
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
Let p1, p2, p3 be three noncollinear points in the plane, and let P be a set of n other points in th...
AbstractThe question of how often the same distance can occur between k distinct points in n-dimensi...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
Abstract. In 1989, Erdős conjectured that for a sufficiently large n it is impossible to place n po...
We show that for m points and n lines in R2, the number of distinct distances between the points and...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractWe prove that among n points in the plane in general position, the shortest distance can occ...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less ...
We show that for m points and n lines in R-2, the number of distinct distances between the points an...
DOI
Add to ORKG