The rectilinear crossing number of K_n: closing in (or are we?)

DOI10.1007/978-1-4614-0110-0_2zbMATH Open1272.05029OpenAlexW149069588MaRDI QIDQ2849795FDOQ2849795

Authors: Silvia Fernández-Merchant, B. M. Ábrego, Gelasio Salazar 

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

Recommendations

• scientific article; zbMATH DE number 1047749
• The rectilinear local crossing number of \(K_{n}\)
• On the crossing number of complete graphs
• On the crossing number of complete graphs
• The Crossing Number of Graphs: Theory and Computation

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) Graph representations (geometric and intersection representations, etc.) (05C62) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Erd?s problems and related topics of discrete geometry (52C10) Combinatorial complexity of geometric structures (52C45)

Cited In (20)

• The Crossing Number of Graphs: Theory and Computation
• Approximating the rectilinear crossing number
• On compatible matchings
• There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
• A lower bound on the crossing number of uniform hypergraphs
• Approximating the rectilinear crossing number
• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
• Enumerations of the maximum rectilinear crossing numbers of complete and complete multi-partite graphs
• Graph Drawing via Gradient Descent, $$(GD)^2$$
• A Ramsey-type result for geometric \(\ell\)-hypergraphs
• On Compatible Matchings
• Title not available (Why is that?)
• Maximum rectilinear crossing number of uniform hypergraphs
• An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
• Parameterized analysis and crossing minimization problems
• A survey of mass partitions
• Automated mathematical discovery and verification: minimizing pentagons in the plane
• The 2-page crossing number of \(K_{n}\)
• There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
• Stress-Plus-X (SPX) graph layout

This page was built for publication: The rectilinear crossing number of \(K_n\): closing in (or are we?)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849795)