AbstractIn this paper it is shown thatlimn→∞n−4c(kn)=164where c(Kn) denotes the minimum number of crossings with which the complete graph Kn can be drawn in the plane. Our result depends on the hypothesis of Zarankiewicz that c(Kp,q)=[P2][p−12][q2][q−12
AbstractIn drawings (two edges have at most one point in common, either a node or a crossing) of the...
AbstractScheinerman and Wilf (Amer. Math. Monthly 101 (1994) 939) assert that “an important open pro...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractIn drawings (two edges have at most one point in common, either a node or a crossing) of the...
AbstractCycle drawings of Kn use edges either inside or outside of a convex n-gon. The smallest n su...
In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = ...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
AbstractIt is shown that the toroidal crossing number of the complete bipartite graph, Km, n, lies b...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
We show that if a graph of v vertices can be drawn in the plane so that every edge crosses at most k...
We show that if a graph of v vertices can be drawn in the plane so that every edge crosses at most k...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
AbstractIn drawings (two edges have at most one point in common, either a node or a crossing) of the...
AbstractScheinerman and Wilf (Amer. Math. Monthly 101 (1994) 939) assert that “an important open pro...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractIn drawings (two edges have at most one point in common, either a node or a crossing) of the...
AbstractCycle drawings of Kn use edges either inside or outside of a convex n-gon. The smallest n su...
In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = ...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
AbstractIt is shown that the toroidal crossing number of the complete bipartite graph, Km, n, lies b...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
We show that if a graph of v vertices can be drawn in the plane so that every edge crosses at most k...
We show that if a graph of v vertices can be drawn in the plane so that every edge crosses at most k...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
AbstractIn drawings (two edges have at most one point in common, either a node or a crossing) of the...
AbstractScheinerman and Wilf (Amer. Math. Monthly 101 (1994) 939) assert that “an important open pro...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
DOI
Add to ORKG