The Dirac-Goodman-Pollack conjecture
\textit{J. E. Goodman} and \textit{R. Pollack} [Numerantium 32, 383--394 (1981; Zbl 0495.05012)] gave abstract combinatorial generalizations for three problems in discrete geometry, in terms of \textit{allowable sequences}. These problems included Dirac's Conjecture: Given a set \(S\) of \(n\) non-colllinear points in the plane, there exists a point in \(S\) incident to \(cn\) lines determined by \(S\), for some constant \(c > 0\). In 1983, \textit{J. Beck} [Combinatorica 3, 281--297 (1983; Zbl 0533.52004)] and \textit{E. Szemerédi} and \textit{W. T. Trotter jun.} [Combinatorica 3, 381--392 (1983; Zbl 0541.05012)] independently proved Dirac's Conjecture. The paper under review proves the abstract allowable sequences version of Dirac's Conjecture.
- 2N noncollinear points determine at least 2N directions
- A combinatorial problem in geometry.
- A course in combinatorics.
- A note on the weak Dirac conjecture
- A pseudoline counterexample to the strong Dirac conjecture
- A survey of Sylvester's problem and its generalizations
- Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\)
- Arrangements of Lines with a Large Number of Triangles
- Axioms and hulls
- Coding and counting arrangements of pseudolines
- COLLINEARITY PROPERTIES OF SETS OF POINTS
- Combinatorial geometry and its algorithmic applications. The Alcalá lectures
- Crossing by lines all edges of a line arrangement
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Crossing-Free Subgraphs
- Directions in combinatorial geometry
- Distinct Triangle Areas in a Planar Point Set
- Extremal problems in discrete geometry
- Extremal problems related to the Sylvester-Gallai theorem
- scientific article; zbMATH DE number 431988 (Why is no real title available?)
- scientific article; zbMATH DE number 3160700 (Why is no real title available?)
- scientific article; zbMATH DE number 3162927 (Why is no real title available?)
- scientific article; zbMATH DE number 3168302 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3779340 (Why is no real title available?)
- scientific article; zbMATH DE number 51916 (Why is no real title available?)
- scientific article; zbMATH DE number 2109336 (Why is no real title available?)
- scientific article; zbMATH DE number 863486 (Why is no real title available?)
- scientific article; zbMATH DE number 3394958 (Why is no real title available?)
- scientific article; zbMATH DE number 3049937 (Why is no real title available?)
- Improving the crossing lemma by finding more crossings in sparse graphs
- Multiple intersections of diagonals of regular polygons, and related topics
- New lower bound techniques for VLSI
- On sets defining few ordinary lines
- On the combinatorial classification of nondegenerate configurations in the plane
- On the Erdős-Szekeres convex polygon problem
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- On the number of line separations of a finite set in the plane
- On the Number of Ordinary Lines Determined by n Points
- On the Sylvester-Gallai and the orchard problem for pseudoline arrangements
- On topological graphs with at most four crossings per edge
- Progress on Dirac's conjecture
- Proofs from THE BOOK
- Research Problems in Discrete Geometry
- Sets for which no point lies on many connecting lines
- Sylvester's Problem on Collinear Points and a Relative
- The discrete mathematical charms of Paul Erdős. A simple introduction
- The Lines and Planes Connecting the Points of a Finite Set
- There exist \(6n/13\) ordinary points
- Two extensions of the Erdős-Szekeres problem
- Unsolved problems in geometry
This page was built for publication: The Dirac-Goodman-Pollack conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624175)
