Sciweavers

973 search results - page 4 / 195
» New Bounds on Crossing Numbers
Sort
View
DCG
2006
96views more  DCG 2006»
14 years 11 months ago
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of ( k)
József Balogh, Gelasio Salazar
JGT
2010
113views more  JGT 2010»
14 years 10 months ago
Crossing numbers of imbalanced graphs
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...
János Pach, József Solymosi, G&aacut...
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
15 years 1 months ago
On the rectilinear crossing number of complete graphs
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...
Uli Wagner
ENDM
2008
81views more  ENDM 2008»
14 years 11 months ago
The maximum number of halving lines and the rectilinear crossing number of Kn for n
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
Bernardo M. Ábrego, Silvia Fernández...
ENDM
2008
118views more  ENDM 2008»
14 years 11 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
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...
Andreas Razen, Jack Snoeyink, Emo Welzl