Add to ORKGA rectilinear crossing number is the minimal crossing of the edges of a complete graph using straight lines. It differs from the general crossing number for n ≥ 10 and n=8. The Rectilinear Crossing Project compiles the latest results for this problem. This Demonstration allows you to move the points so that the minimal crossing number can be achieved. The caption indicates the number of crossings for the graph shown. You can verify that your configuration matches with the best known value by clicking on the box.Educação Superior::Ciências Exatas e da Terra::Matemátic
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
Here we consider the minimum of the maximum rectilinear crossing numbers for all d-regular g...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
A rectilinear crossing number is the minimal crossing of the edges of a complete graph using straigh...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
We prove a lower bound of 0.3288 n 4¡for the rectilinear crossing number cr(Kn) of a complete graph ...
We give a new lower bound for the rectilinear crossing number cr(n) of the complete geometric graph ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
Here we consider the minimum of the maximum rectilinear crossing numbers for all d-regular g...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
A rectilinear crossing number is the minimal crossing of the edges of a complete graph using straigh...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
We prove a lower bound of 0.3288 n 4¡for the rectilinear crossing number cr(Kn) of a complete graph ...
We give a new lower bound for the rectilinear crossing number cr(n) of the complete geometric graph ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
Here we consider the minimum of the maximum rectilinear crossing numbers for all d-regular g...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...