The 3-symmetric pseudolinear crossing number of \(K_{36}\)

DOI10.1016/j.disc.2023.113804zbMath1530.05133MaRDI QIDQ6177413

Omar de Avila-Martínez, Jesús Leaños, Carolina Medina

Publication date: 17 January 2024

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

zbMATH Keywords

complete graphpseudolinear crossing number\(m\)-symmetric drawingsgeometric crossing number

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• Geometric drawings of \(K_{n}\) with few crossings
• An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)
• 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
• On the combinatorial classification of nondegenerate configurations in the plane
• Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)
• 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
• The maximum number of halving lines and the rectilinear crossing number of for
• Crossing Number Problems