Erdős–Gyárfás conjecture ingelesa (Q3686826)
Nabigaziora joan
Bilaketara joan
unproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of two ingelesa
| Hizkuntza | Etiketa | Deskribapena | Goitizenak |
|---|---|---|---|
| euskara | Ez da etiketarik zehaztu |
Ez da deskribapenik zehaztu |
|
| ingelesa | Erdős–Gyárfás conjecture |
unproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of two |
Adierazpenak
Identifikatzaileak
Erreferentzia bat
Freebase Data Dumps ingelesa
28 urria 2013
Sitelinks
Wikipedia(6 sarrera)
- enwiki Erdős–Gyárfás conjecture
- frwiki Conjecture d'Erdős-Gyárfás
- huwiki Erdős–Gyárfás-sejtés
- itwiki Congettura di Erdős-Gyárfás
- ruwiki Гипотеза Эрдёша — Дьярфаша
- slwiki Erdős-Gyárfásova domneva