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

DOI10.1007/978-1-4614-0110-0_2zbMath1272.05029MaRDI 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

60D05: Geometric probability and stochastic geometry

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

52C10: Erd?s problems and related topics of discrete geometry

05C62: Graph representations (geometric and intersection representations, etc.)

52A22: Random convex sets and integral geometry (aspects of convex geometry)

52C45: Combinatorial complexity of geometric structures

Related Items

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