Pages that link to "Item:Q1144583"

The following pages link to Proof of a conjecture of Burr, Grünbaum, and Sloane (Q1144583):

Displaying 41 items.

• Chambers of wiring diagrams (Q294551) (← links)
• LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies (Q377487) (← links)
• Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
• Coding and counting arrangements of pseudolines (Q644821) (← links)
• Arrangements of pseudocircles and circles (Q741610) (← links)
• Semispaces of configurations, cell complexes of arrangements (Q801058) (← links)
• On degree sequences and eccentricities in pseudoline arrangement graphs (Q831726) (← links)
• Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
• The combinatorial encoding of disjoint convex sets in the plane (Q949781) (← links)
• An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) (Q958731) (← links)
• Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
• A conjugation-free geometric presentation of fundamental groups of arrangements (Q993405) (← links)
• Tverberg-type theorems for pseudoconfigurations of points in the plane (Q1124597) (← links)
• Helly-type theorems for pseudoline arrangments in \(P^ 2\). (Q1166115) (← links)
• The complexity of point configurations (Q1175788) (← links)
• Some provably hard crossing number problems (Q1176321) (← links)
• Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.) (Q1296148) (← links)
• Order on order types (Q1650795) (← links)
• Ham-sandwich cuts for abstract order types (Q1702128) (← links)
• The number of extreme triples of a planar point set (Q1921337) (← links)
• Parallelogram tilings, worms, and finite orientations (Q1953058) (← links)
• Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs (Q2039302) (← links)
• Arrangements of approaching pseudo-lines (Q2117345) (← links)
• The loop-linking number of line arrangements (Q2137869) (← links)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
• Realization spaces of arrangements of convex bodies (Q2408184) (← links)
• Regular systems of paths and families of convex sets in convex position (Q2790591) (← links)
• Representing permutations with few moves (Q2827490) (← links)
• Factorization of banded permutations (Q2846735) (← links)
• The Erdős-Szekeres problem for non-crossing convex sets (Q2874619) (← links)
• On the Pseudolinear Crossing Number (Q2978177) (← links)
• CLASSES OF WIRING DIAGRAMS AND THEIR INVARIANTS (Q4414963) (← links)
• Subquadratic Encodings for Point Configurations (Q5115787) (← links)
• An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q5370571) (← links)
• The unavoidable arrangements of pseudocircles (Q5384839) (← links)
• Enumeration of simple complete topological graphs (Q5900075) (← links)
• Enumeration of simple complete topological graphs (Q5902255) (← links)
• Sweeps, arrangements and signotopes (Q5929322) (← links)
• A classification of peak-pit maximal Condorcet domains (Q6080658) (← links)
• Twisted ways to find plane structures in simple drawings of complete graphs (Q6145668) (← links)
• Unexpected Stein fillings, rational surface singularities and plane curve arrangements (Q6157233) (← links)