Progress on Dirac's conjecture
From MaRDI portal
Publication:405200
zbMath1297.52005arXiv1207.3594MaRDI QIDQ405200
Michael S. Payne, David R. Wood
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.3594
Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Related Items (6)
A note on the minimum number of red lines needed to pierce the intersections of blue lines ⋮ A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane ⋮ Crossing by lines all edges of a line arrangement ⋮ A pseudoline counterexample to the strong Dirac conjecture ⋮ Hirzebruch-type inequalities viewed as tools in combinatorics ⋮ A note on the weak Dirac conjecture
Cites Work
- A pseudoline counterexample to the strong Dirac conjecture
- 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
- Improving the crossing lemma by finding more crossings in sparse graphs
- Some combinatorial problems in the plane
- A proof of a consequence of Dirac's conjecture
- Two combinatorial problems in the plane
- On the Number of Ordinary Lines Determined by n Points
- Crossing-Free Subgraphs
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- COLLINEARITY PROPERTIES OF SETS OF POINTS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Progress on Dirac's conjecture
