Read on Wikipedia

Image: David Eppstein · Public domain

Hadwiger conjecture (graph theory)

Hadwiger conjecture (graph theory)

Unproven generalization of the four-color theorem.

Rare
35 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 2,590

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 899 clicks on its links

  1. Graph minor

    Subgraph with contracted edges.

    19%

  2. Hadwiger conjecture (combinatorial geometry)

    13%

  3. Graph coloring

    Methodic assignment of colors to elements of a graph.

    12%

  4. Four color theorem

    Planar maps require at most four colors.

    11%

  5. Hugo Hadwiger

    Swiss mathematician (1908–1981).

    10%

  6. Loop (graph theory)

    Edge that connects a node to itself.

    9.7%

  7. Snark (graph theory)

    3-regular graph with no 3-edge-coloring.

    3%

  8. Series–parallel graph

    Recursively-formed graph with two terminal vertices.

    2.4%

  9. Graph theory

    Area of discrete mathematics.

    1.2%

  10. Wagner's theorem

    On forbidden minors in planar graphs.

    1.2%

Readers come from

Share of the 967 readers arriving from another article

  1. Four color theorem

    Planar maps require at most four colors.

    29%

  2. Hadwiger–Nelson problem

    Mathematical problem.

    26%

  3. Hadwiger conjecture (combinatorial geometry)

    4.6%

  4. Graph minor

    Subgraph with contracted edges.

    3.5%

  5. Hugo Hadwiger

    Swiss mathematician (1908–1981).

    2.8%

  6. Graph theory

    Area of discrete mathematics.

    1.8%

  7. Clique (graph theory)

    Adjacent subset of an undirected graph.

    1%