Minimal Crossings for Complete Graphs

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

A 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 and . The Rectilinear Crossing Project compiles the latest results for this problem.

[more]

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.

[less]

Contributed by: Theodore S. Erickson (Wheeling Jesuit University) (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send