This problem is related to problem 58384.
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
Solve

Solution Stats

13 Solutions

13 Solvers

Last Solution submitted on Mar 03, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers13

Pauli Huusari Riccardo G. CXD Michael

Suggested Problems

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!