The Rectilinear Crossing Number of K n : Closing in (or Are We?)

DOI10.1007/978-1-4614-0110-0_2zbMath1272.05029OpenAlexW149069588MaRDI QIDQ2849795

Silvia Fernández-Merchant, Gelasio Salazar, Bernardo M. Ábrego

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_2

zbMATH Keywords

rectilinear crossing number of complete graphs

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Combinatorial complexity of geometric structures (52C45)

Related Items (14)

A lower bound on the crossing number of uniform hypergraphs ⋮ On Compatible Matchings ⋮ A survey of mass partitions ⋮ The 2-page crossing number of \(K_{n}\) ⋮ Parameterized analysis and crossing minimization problems ⋮ Maximum rectilinear crossing number of uniform hypergraphs ⋮ Approximating the Rectilinear Crossing Number ⋮ An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants ⋮ Stress-Plus-X (SPX) graph layout ⋮ On compatible matchings ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ A Ramsey-type result for geometric \(\ell\)-hypergraphs ⋮ Approximating the rectilinear crossing number ⋮ Graph Drawing via Gradient Descent, $$(GD)^2$$

This page was built for publication: The Rectilinear Crossing Number of K n : Closing in (or Are We?)