A Lower Bound for the Rectilinear Crossing Number

Authors:
Bernardo M. Ábrego;Silvia Fernández-Merchant
Affiliations:
Department of Mathematics, California State University Northridge, 18111 Nordhoff, 91330-8313, St. Northridge, CA, USA;Department of Mathematics, California State University Northridge, 18111 Nordhoff, 91330-8313, St. Northridge, CA, USA
Venue:
Graphs and Combinatorics
Year:
2005

Citing 0
Cited 6

Note: Geometric drawings of Kn with few crossings

Journal of Combinatorial Theory Series A
Note: An extended lower bound on the number of (≤k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn

Journal of Combinatorial Theory Series A
On Center Regions and Balls Containing Many Points

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
New results on lower bounds for the number of (≤k)-facets

European Journal of Combinatorics
3-symmetric and 3-decomposable geometric drawings of Kn

Discrete Applied Mathematics
The 2-page crossing number of Kn

Proceedings of the twenty-eighth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a new lower bound for the rectilinear crossing number ** of the complete geometric graph Kn. We prove that ** and we extend the proof of the result to pseudolinear drawings of Kn.