Ringel–Youngs theorem
Sign in to saveAlso known as Heawood conjecture
theorem on the number of colors needed for graphs embedded on higher genus surfaces
In the Vinony graph
Within Vinony's link graph, Ringel–Youngs theorem is referenced by 17 other articles, and connects out to sphere, mathematical proof and digital object identifier.
It sits within the topics Conjectures that have been proved, Graph coloring and Theorems in graph theory.
Its subject is documented across 6 Wikipedia language editions.
Wikidata facts
- Instance of
- conjecture
- Part of
- list of theorems
- Named after
- Percy John Heawood
Show 1 more fact
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
Connections
sphere
Entity
mathematical proof
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
plane
Entity
graph theory
Entity
surface
Entity
PubMed
Entity
torus
Entity
bibcode
Entity
four color theorem
Entity
PubMed Central
Entity
conjecture
Entity
Klein bottle
Entity
Euler characteristic
Entity
On-Line Encyclopedia of Integer Sequences
Entity
complete graph
Entity
MathWorld
Entity
graph coloring
Entity
Proceedings of the National Academy of Sciences of the United States of America
Entity