Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics

DOI10.1016/S0012-365X(02)00491-0zbMath1013.05027arXivcs/0009028MaRDI QIDQ1868837

Alex Brodsky, Ellen Gethner, Stephane Durocher

Publication date: 28 April 2003

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

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

zbMATH Keywords

crossing numberrectilinearcomplete graph

Mathematics Subject Classification ID

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

Related Items (6)

Crossing numbers of random graphs ⋮ Geometric drawings of \(K_{n}\) with few crossings ⋮ An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants ⋮ 3-symmetric and 3-decomposable geometric drawings of \(K_n\) ⋮ A lower bound for the rectilinear crossing number ⋮ On the crossing number of complete graphs

This page was built for publication: Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics