Erdős–Gyárfás conjecture (Q3686826)
Jump to navigation
Jump to search
unproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of two
Language | Label | Description | Also known as |
---|---|---|---|
English | 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 |
Statements
Identifiers
Sitelinks
Wikipedia(6 entries)
- 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