AbstractErdős asked the following question: is it true that a set of n2 points in the plane always contain 2n−2 points which do not determine a right angle? We show that, apart from a log-factor, the answer is in the affirmative
AbstractHere it is shown that n points in the plane, no three on a line, always determine at least n...
In this paper, we prove that a set of N points in R2 has at least cNlogN distinct distances, thus ob...
AbstractArguments using elementary number theory are used to construct counterexamples to a conjectu...
AbstractErdős asked the following question: is it true that a set of n2 points in the plane always c...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
AbstractWe show that a set of n points in the plane determine O(n2 log n) triples that define the sa...
In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position i...
AbstractLet P be a set of n points in R3, not all of which are in a plane and no three on a line. We...
Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by ...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
We present both probabilistic and constructive lower bounds on the maximum size of a set of points {...
AbstractGiven n points in three dimensional euclidean space, not all lying on aplane, let l be the n...
The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane wit...
We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac...
We call a set of n points in the Euclidean plane "wide" if at most root n of its points are collinea...
AbstractHere it is shown that n points in the plane, no three on a line, always determine at least n...
In this paper, we prove that a set of N points in R2 has at least cNlogN distinct distances, thus ob...
AbstractArguments using elementary number theory are used to construct counterexamples to a conjectu...
AbstractErdős asked the following question: is it true that a set of n2 points in the plane always c...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
AbstractWe show that a set of n points in the plane determine O(n2 log n) triples that define the sa...
In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position i...
AbstractLet P be a set of n points in R3, not all of which are in a plane and no three on a line. We...
Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by ...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
We present both probabilistic and constructive lower bounds on the maximum size of a set of points {...
AbstractGiven n points in three dimensional euclidean space, not all lying on aplane, let l be the n...
The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane wit...
We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac...
We call a set of n points in the Euclidean plane "wide" if at most root n of its points are collinea...
AbstractHere it is shown that n points in the plane, no three on a line, always determine at least n...
In this paper, we prove that a set of N points in R2 has at least cNlogN distinct distances, thus ob...
AbstractArguments using elementary number theory are used to construct counterexamples to a conjectu...
DOI
Add to ORKG