The Dirac-Goodman-Pollack conjecture

DOI10.1007/S00454-023-00487-ZMaRDI QIDQ6624175

Adrian Dumitrescu

Publication date: 25 October 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

Szemerédi-Trotter theoremcrossing lemmaDirac's conjectureSylvester's problemallowable sequenceSzékely's method

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On sets defining few ordinary lines
• Crossing by lines all edges of a line arrangement
• Progress on Dirac's conjecture
• A pseudoline counterexample to the strong Dirac conjecture
• A note on the weak Dirac conjecture
• Coding and counting arrangements of pseudolines
• Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\)
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Extremal problems in discrete geometry
• Directions in combinatorial geometry
• Improving the crossing lemma by finding more crossings in sparse graphs
• Multiple intersections of diagonals of regular polygons, and related topics
• On the combinatorial classification of nondegenerate configurations in the plane
• 2N noncollinear points determine at least 2N directions
• Unsolved problems in geometry
• Axioms and hulls
• There exist \(6n/13\) ordinary points
• Sets for which no point lies on many connecting lines
• On the Sylvester-Gallai and the orchard problem for pseudoline arrangements
• On the number of line separations of a finite set in the plane
• On topological graphs with at most four crossings per edge
• Two extensions of the Erdős-Szekeres problem
• A combinatorial problem in geometry.
• A survey of Sylvester's problem and its generalizations
• A course in combinatorics.
• Research Problems in Discrete Geometry
• On the Number of Ordinary Lines Determined by n Points
• Arrangements of Lines with a Large Number of Triangles
• New lower bound techniques for VLSI
• Crossing-Free Subgraphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On the Erdős-Szekeres convex polygon problem
• Distinct Triangle Areas in a Planar Point Set
• Sylvester's Problem on Collinear Points and a Relative
• COLLINEARITY PROPERTIES OF SETS OF POINTS
• The Lines and Planes Connecting the Points of a Finite Set
• The Discrete Mathematical Charms of Paul Erdős
• Proofs from THE BOOK

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)