119 search results - page 5 / 24 » Crossing numbers of imbalanced graphs |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
ENDM
2008
13 years 7 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
GD
2005
Springer
14 years 1 months ago
2005
Springer
GD
2006
Springer
13 years 11 months ago
2006
Springer
DCG
2010
13 years 7 months ago
2010