Read on Wikipedia

Image: David Eppstein · Public domain

Crossing number (graph theory)

Crossing number (graph theory)

Fewest edge crossings in drawing of a graph.

Rare
24 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

RareTop 25%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 679

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 117 clicks on its links

  1. Turán's brick factory problem

    On minimizing crossings in bicliques.

    48%

  2. Heawood graph

    Undirected graph with 14 vertices.

    24%

  3. Albertson conjecture

    Relation between graph coloring and crossings.

    9.4%

  4. Happy ending problem

    Five coplanar points have a subset forming a convex quadrilateral.

    8.5%

Readers come from

Share of the 139 readers arriving from another article

  1. Graph theory

    Area of discrete mathematics.

    19%

  2. Turán's brick factory problem

    On minimizing crossings in bicliques.

    9.4%

  3. Complete graph

    Graph in which every two vertices are adjacent.

    8.6%

  4. Albertson conjecture

    Relation between graph coloring and crossings.

    7.9%