3-symmetric and 3-decomposable geometric drawings of \(K_n\)

DOI10.1016/j.dam.2009.09.020zbMath1228.05214arXiv0805.0016OpenAlexW1986278299MaRDI QIDQ987669

M. Cetina, Bernardo M. Ábrego, Jesús Leaños, Gelasio Salazar, Silvia Fernández-Merchant

Publication date: 13 August 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.0016

zbMATH Keywords

\(k\)-setsgeometric drawingsrectilinear crossing numberssymmetric drawings

Mathematics Subject Classification ID

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

Related Items

The rectilinear local crossing number of \(K_{n}\) ⋮ Geometric achromatic and pseudoachromatic indices ⋮ The 2-page crossing number of \(K_{n}\) ⋮ From art and circuit design to geometry and combinatorics ⋮ The 3-symmetric pseudolinear crossing number of \(K_{36}\) ⋮ Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian ⋮ On crossing numbers of geometric proximity graphs ⋮ An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants ⋮ On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) ⋮ Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)

Cites Work

• Unnamed Item
• On the crossing number of complete graphs
• Geometric drawings of \(K_{n}\) with few crossings
• On the combinatorial classification of nondegenerate configurations in the plane
• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
• New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\)
• A lower bound for the rectilinear crossing number
• Research Problems in Discrete Geometry
• 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
• Crossing Number Problems

This page was built for publication: 3-symmetric and 3-decomposable geometric drawings of \(K_n\)