Proof of a conjecture of Burr, Grünbaum, and Sloane
From MaRDI portal
Publication:1144583
DOI10.1016/0012-365X(80)90096-5zbMath0444.05029OpenAlexW2091316025WikidataQ56815619 ScholiaQ56815619MaRDI QIDQ1144583
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(80)90096-5
Related Items
On degree sequences and eccentricities in pseudoline arrangement graphs ⋮ Chambers of wiring diagrams ⋮ The loop-linking number of line arrangements ⋮ An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings ⋮ Order on order types ⋮ Hamiltonicity and colorings of arrangement graphs ⋮ The number of extreme triples of a planar point set ⋮ Tverberg-type theorems for pseudoconfigurations of points in the plane ⋮ Realization spaces of arrangements of convex bodies ⋮ LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies ⋮ A classification of peak-pit maximal Condorcet domains ⋮ Twisted ways to find plane structures in simple drawings of complete graphs ⋮ Unexpected Stein fillings, rational surface singularities and plane curve arrangements ⋮ Simple realizability of complete abstract topological graphs in P ⋮ Ham-sandwich cuts for abstract order types ⋮ Parallelogram tilings, worms, and finite orientations ⋮ Coding and counting arrangements of pseudolines ⋮ On the Pseudolinear Crossing Number ⋮ Helly-type theorems for pseudoline arrangments in \(P^ 2\). ⋮ The unavoidable arrangements of pseudocircles ⋮ The complexity of point configurations ⋮ Some provably hard crossing number problems ⋮ The combinatorial encoding of disjoint convex sets in the plane ⋮ Enumeration of simple complete topological graphs ⋮ An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) ⋮ Enumeration of simple complete topological graphs ⋮ Sweeps, arrangements and signotopes ⋮ Efficient enumeration of all ladder lotteries and its application ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ CLASSES OF WIRING DIAGRAMS AND THEIR INVARIANTS ⋮ Regular systems of paths and families of convex sets in convex position ⋮ A conjugation-free geometric presentation of fundamental groups of arrangements ⋮ Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs ⋮ Arrangements of pseudocircles and circles ⋮ Representing Permutations with Few Moves ⋮ Factorization of banded permutations ⋮ Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.) ⋮ Subquadratic Encodings for Point Configurations ⋮ Semispaces of configurations, cell complexes of arrangements ⋮ THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS ⋮ Arrangements of approaching pseudo-lines
Cites Work
- Unnamed Item
- On the combinatorial classification of nondegenerate configurations in the plane
- Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines
- A theorem of ordered duality
- The orchard problem
- Simple points in pseudoline arrangements
- On the Number of Ordinary Lines Determined by n Points
