A complete graph may be drawn in different ways, such that the number of line crossings differs between drawings.
To date, the question of how to draw the graph so as to minimize the number of crossings remains unsolved.
Nevertheless, an upper bound can be calculated for the number of crossings, based on the number of vertices in the graph.
Given the number of vertices, n, calculate the upper bound, b, for the minimum number of line crossings in the resulting complete graph.
Example:
n = 6;
b = 3
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers13
Suggested Problems
-
Return the 3n+1 sequence for n
8491 Solvers
-
1329 Solvers
-
Output any real number that is neither positive nor negative
410 Solvers
-
Put Two 1D matrices into one 1D matrix
142 Solvers
-
Matlab Basics - Set unwanted parts of a vector to zero
261 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
