A lower bound for the rectilinear crossing number
From MaRDI portal
Publication:2573799
DOI10.1007/s00373-005-0612-5zbMath1075.05022OpenAlexW2029664891MaRDI QIDQ2573799
Silvia Fernández-Merchant, Bernardo M. Ábrego
Publication date: 24 November 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10211.3/195956
Related Items (22)
Bishellable drawings of $K_n$ ⋮ The 2-page crossing number of \(K_{n}\) ⋮ The crossing number of twisted graphs ⋮ Geometric drawings of \(K_{n}\) with few crossings ⋮ New results on lower bounds for the number of (⩽ k)-facets ⋮ The maximum number of halving lines and the rectilinear crossing number of for ⋮ A central approach to bound the number of crossings in a generalized configuration ⋮ On Center Regions and Balls Containing Many Points ⋮ The 3-symmetric pseudolinear crossing number of \(K_{36}\) ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) ⋮ Unnamed Item ⋮ An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ New algorithms and bounds for halving pseudolines ⋮ Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\) ⋮ 3-symmetric and 3-decomposable geometric drawings of \(K_n\) ⋮ Weighted Turán problems with applications ⋮ Extending Drawings of Complete Graphs into Arrangements of Pseudocircles ⋮ New results on lower bounds for the number of \((\leq k)\)-facets ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ On the crossing number of complete graphs
Cites Work
- On the crossing number of complete graphs
- Helly-type theorems for pseudoline arrangments in \(P^ 2\).
- Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
- An upper bound for the rectilinear crossing number of the complete graph
- On a problem of P. Turan concerning graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A lower bound for the rectilinear crossing number
