🌐EnglishEnglishFrançaisItalianoNederlandsРусский中文日本語EntityQ3686826· pop 6· linked from 8 articlesErdős–Gyárfás conjectureunproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of twoAvailable in 6 languagesFrançaisРусскийItalianoHungarianSlovenianvia Wikidata sitelinks · CC0Connectionsdigital object identifierEntityPaul ErdősEntityCategoriesConjecturesPaul ErdősUnsolved problems in graph theory