A Pseudoline Counterexample to the Strong Dirac Conjecture

Type: Article

Publication Date: 2014-05-13

Citations: 3

DOI: https://doi.org/10.37236/4015

Abstract

We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of $n$ pseudolines has no member incident to more than $4n/9$ points of intersection. This shows the "Strong Dirac" conjecture to be false for pseudolines.We also raise a number of open problems relating to possible differences between the structure of incidences between points and lines versus the structure of incidences between points and pseudolines.

Locations

  • The Electronic Journal of Combinatorics - View - PDF
  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ A Pseudoline Counterexample to the Strong Dirac Conjecture 2012 Ben Lund
George Purdy
Justin W. Smith
+ A Pseudoline Counterexample to the Strong Dirac Conjecture 2012 Ben Lund
George Purdy
Justin W. Smith
+ Some Results Related to a Conjecture of Dirac's 2012 Ben Lund
George Purdy
Justin W. Smith
+ Crossing by lines all edges of a line arrangement 2013 Rom Pinchasi
+ PDF Chat Simple points in pseudoline arrangements 1972 L. M. Kelly
Reuven R. Rottenberg
+ PDF Chat Quasi-configurations: Building blocks for point-line configurations 2015 Jürgen Bokowski
Vincent Pilaud
+ PDF Chat Improved Lower Bound on the Number of Pseudoline Arrangements 2024 Justin Dallant
+ Pseudoline Arrangements 2004
+ Pseudoline Arrangements 2004 Jacob E. Goodman
+ A new progress on Weak Dirac conjecture 2016 Hoang-Ha Pham
Tien-Cuong Phi
+ PDF Chat On the Number of Arrangements of Pseudolines 1997 Stefan Felsner
+ PDF Chat An Improved Lower Bound on the Number of Pseudoline Arrangements 2024 Fernando Cortés Kühnast
Stefan Felsner
Manfred Scheucher
+ PDF Chat New Lower Bounds for the Number of Pseudoline Arrangements 2019 Adrian Dumitrescu
Ritankar Mandal
+ PDF Chat Coloring problems on arrangements of pseudolines 2024 Sandro Roch
+ On the Dirac-Motzkin conjecture for supersolvable line arrangements 2015 Benjamin Anzis
Ştefan Tohǎneanu
+ New Lower Bounds for the Number of Pseudoline Arrangements 2018 Adrian Dumitrescu
Ritankar Mandal
+ PDF Chat Symmetric Simplicial Pseudoline Arrangements 2008 Leah Wrenn Berman
+ PDF Chat Triangles in Euclidean Arrangements 1998 Stefan Felsner
Klaus Kriegel
+ Intersection Graphs of Pseudosegments: Chordal Graphs 2008 Cornelia Dangelmayr
Stefan Felsner
William T. Trotter
+ New lower bounds for the number of pseudoline arrangements 2019 Adrian Dumitrescu
Ritankar Mandal