101 search results - page 2 / 21 » Improvement on the Decay of Crossing Numbers |
103
Voted
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
SODA
2003
ACM
15 years 1 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...
JGT
2010
14 years 10 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
DCG
2006
15 years 2 days ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
ENDM
2008
15 years 4 days ago
2008
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...