Note: Geometric drawings of Kn with few crossings

Authors:
Bernardo M. Ábrego;Silvia Fernández-Merchant
Affiliations:
Department of Mathematics, California State University, Northridge, 18111 Nordhoff St, Northridge, CA 91330-8313, USA;Department of Mathematics, California State University, Northridge, 18111 Nordhoff St, Northridge, CA 91330-8313, USA
Venue:
Journal of Combinatorial Theory Series A
Year:
2007

Citing 6
Cited 1

Lectures on Discrete Geometry

Lectures on Discrete Geometry
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics

Discrete Mathematics
On the rectilinear crossing number of complete graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Abstract order type extension and new results on the rectilinear crossing number

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On the Crossing Number of Complete Graphs

Computing
A Lower Bound for the Rectilinear Crossing Number

Graphs and Combinatorics

3-symmetric and 3-decomposable geometric drawings of Kn

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a new upper bound for the rectilinear crossing number cr@?(n) of the complete geometric graph K"n. We prove that cr@?(n)=