499 search results - page 1 / 100 » On the Decay of Crossing Numbers |
GD
2007
Springer
13 years 11 months ago
2007
Springer
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
GD
2006
Springer
13 years 8 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
DCG
2008
13 years 4 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
DAM
2007
13 years 4 months ago
2007
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
GD
2007
Springer
13 years 11 months ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...