In 1951, Gabriel Dirac conjectured that every non-collinear set P of n points in the plane contains a point incident to at least n2 − c of the lines determined by P, for some constant c. The following weakened conjecture was proved by Beck and by Szemerédi and Trotter: every non-collinear set P of n points in the plane contains a point in at least nc ′ lines determined by P, for some constant c ′. We prove this result with c ′ = 37. We also give the best known constant for Beck’s Theorem, proving that every set of n points with at most ` collinear determines at least 198n(n − `) lines.
Abstract Erd""os, Purdy, and Straus conjectured that the number of distinct (nonze...
We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficientl...
AbstractA conjecture is formulated for an upper bound on the number of points in PG(2,q) of a plane ...
We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudo-li...
Abstract. Let P be a set of n points in the plane, not all on a line. We show that if n is large the...
AbstractA radial point for a finite set P in the plane is a pointq≠∈P with the property that each li...
AbstractGiven n points in three dimensional euclidean space, not all lying on aplane, let l be the n...
In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial gene...
The Sylvester-Gallai theorem asserts that any non-collinear point set in the plane de-termines a lin...
AbstractDe Bruijn and Erdös proved that every noncollinear set of n points in the plane determines a...
© 2014 Dr. Michael S. PayneIn this thesis various combinatorial problems relating to the geometry of...
Suppose you have n points in the plane, not all on a line. A famous theorem of Sylvester-Gallai asse...
We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficientl...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
Andr\'e's celebrated Theorem of 1998 implies that each complex straight line (apart from obvious exc...
Abstract Erd""os, Purdy, and Straus conjectured that the number of distinct (nonze...
We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficientl...
AbstractA conjecture is formulated for an upper bound on the number of points in PG(2,q) of a plane ...
We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudo-li...
Abstract. Let P be a set of n points in the plane, not all on a line. We show that if n is large the...
AbstractA radial point for a finite set P in the plane is a pointq≠∈P with the property that each li...
AbstractGiven n points in three dimensional euclidean space, not all lying on aplane, let l be the n...
In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial gene...
The Sylvester-Gallai theorem asserts that any non-collinear point set in the plane de-termines a lin...
AbstractDe Bruijn and Erdös proved that every noncollinear set of n points in the plane determines a...
© 2014 Dr. Michael S. PayneIn this thesis various combinatorial problems relating to the geometry of...
Suppose you have n points in the plane, not all on a line. A famous theorem of Sylvester-Gallai asse...
We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficientl...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
Andr\'e's celebrated Theorem of 1998 implies that each complex straight line (apart from obvious exc...
Abstract Erd""os, Purdy, and Straus conjectured that the number of distinct (nonze...
We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficientl...
AbstractA conjecture is formulated for an upper bound on the number of points in PG(2,q) of a plane ...