The Dirac-Goodman-Pollack conjecture

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

Adrian Dumitrescu

Publication date: 25 October 2024

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

zbMATH Keywords

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

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)