Home›Conjectures that have been proved›Ringel–Youngs theorem🌐EnglishEnglishDeutschFrançaisPortuguêsTürkçeРусский中文EntityQ2799491· pop 6· linked from 17 articlesRingel–Youngs theoremAlso known as Heawood conjecturetheorem on the number of colors needed for graphs embedded on higher genus surfacesAvailable in 6 languagesFrançaisDeutsch中文РусскийCatalanvia Wikidata sitelinks · CC0ConnectionssphereEntitymathematical proofEntityCategoriesConjectures that have been provedGraph coloringTheorems in graph theoryTopological graph theory