Ringel–Youngs theorem
theorem on the number of colors needed for graphs embedded on higher genus surfaces
Facts
3 properties- Instance of
- theorem (1968–present), conjecture (1890–1968)
- Part of
- list of theorems[5]
🏷️ Also known as
en Heawood conjecture
en Ringel–Youngs theorem
de Satz von Ringel-Youngs
de Heawood-Vermutung
fr théorème de Ringel-Youngs
fr conjecture de Heawood
pt conjectura de Heawood
pt teorema de Ringel–Youngs
ru Гипотеза Хивуда
tr Ringel-Youngs teoremi
zh 曲面染色
🔖 Identifiers · 3
- Freebase ID
- /m/05dflx
- MathWorld ID
- HeawoodConjecture
- Microsoft Academic ID (discontinued)
- 2779718775
🔗 Connections
Named after 3
Instance of 2
Created notable works 1
Maintained by WikiProject 1
Part of 1
Press Enter · cited answer in seconds
0 sources
Summary
Ringel–Youngs theorem is a theorem[1].