Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Hadwiger conjecture · Vinony

🌐English

English Deutsch Français Русский 中文

EntityQ1128435· pop 7· linked from 28 articles

Hadwiger conjecture

conjecture that all graphs requiring k or more colors contain a k-vertex complete minor

Available in 7 languages

Français
Deutsch
Русский
Catalan
Hungarian
Ukrainian

via Wikidata sitelinks · CC0

Connections

glossary of graph theory terms

Categories

Conjectures Graph coloring Graph minor theory Unsolved problems in graph theory

Sources

wikipedia.externallinksexternallink

minor graph

Entity

International Standard Book Number

digital object identifier

four color theorem

bipartite graph

list of unsolved problems in mathematics

Mathematical Reviews

Sign in to save

What links here28 pages

glossary of graph theory terms

Fulkerson Prize

linkless embedding

four color theorem

Colin de Verdière graph invariant

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Erdős–Faber–Lovász conjecture

Entitydist 0.28

graph factorization

Entitydist 0.52

Entitydist 0.53

König's theorem

Entitydist 0.56

Finsler–Hadwiger theorem

Entitydist 0.57

Category:Conjectures that have been proved

Entitydist 0.60

Entitydist 0.60

Turán's theorem

Entitydist 0.62

bipartite dimension

Entitydist 0.62

Category:Conjectures

Entitydist 0.62

Category:Disproved conjectures

Entitydist 0.63

Entitydist 0.63