Geometric drawings of K_n with few crossings

DOI10.1016/J.JCTA.2006.05.003MaRDI QIDQ868888zbMATH OpenOpenAlexFDO

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

Publication date 26 February 2007

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2006.05.003

zbMATH Keywords

complete graphconvex quadrilateralgeometric graphrectilinear crossing number

Mathematics Subject Classification ID

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

Recommendations

• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
• A lower bound for the rectilinear crossing number
• On the crossing number of complete graphs
• scientific article; zbMATH DE number 2079388
• On the crossing number of complete graphs

Cites work

• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\)
• A lower bound for the rectilinear crossing number
• Abstract order type extension and new results on the rectilinear crossing number
• An upper bound for the rectilinear crossing number of the complete graph
• scientific article; zbMATH DE number 2079388 (Why is no real title available?)
• scientific article; zbMATH DE number 1452728 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• scientific article; zbMATH DE number 2145237 (Why is no real title available?)
• On the crossing number of complete graphs
• The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics

Cited in

(26)

• Drawing \(K_{2,n}\): A lower bound
• Drawings of \(C_m\times C_n\) with one disjoint family. II
• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
• On the 2-colored crossing number
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• The rectilinear local crossing number of \(K_{n}\)
• Which \(n\)-Venn diagrams can be drawn with convex \(k\)-gons?
• A lower bound for the rectilinear crossing number
• There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
• A lower bound on the crossing number of uniform hypergraphs
• 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
• Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• Bishellable drawings of K_n
• The optimal drawings of \(K_{5,n}\)
• Counting the regions in a regular drawing of \(K_{n,n}\)
• Limiting Crossing Numbers for Geodesic Drawings on the Sphere
• An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
• Simultaneous embeddings with few bends and crossings
• Empty Triangles in Generalized Twisted Drawings of $K_n$
• The 3-symmetric pseudolinear crossing number of \(K_{36}\)
• There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
• On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs
• Bounds on the crossing resolution of complete geometric graphs
• 3-symmetric and 3-decomposable geometric drawings of \(K_n\)

This page was built for publication: Geometric drawings of \(K_{n}\) with few crossings

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