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
Press Enter · cited answer in seconds
0 sources
Erdős–Gyárfás conjecture
Summary
Erdős–Gyárfás conjecture is a conjecture[1]. It draws 51 Wikipedia views per month (conjecture category, ranking #20 of 128).[2]
Key Facts
- Erdős–Gyárfás conjecture's instance of is recorded as conjecture[3].
- Paul Erdős is named after Erdős–Gyárfás conjecture[4].
- András Gyárfás is named after Erdős–Gyárfás conjecture[5].
- Erdős–Gyárfás conjecture's Freebase ID is recorded as /m/01xlpm[6].
- Erdős–Gyárfás conjecture's Microsoft Academic ID is recorded as 78162934[7].
Body
Designation and Status
Erdős–Gyárfás conjecture's instance of is recorded as conjecture[3].
History and Context
Things named after include Paul Erdős[4], a mathematician[8], 1913–1996[9], of Hungary[10], awarded the Guggenheim Fellowship[11], specialised in probability theory[12] and András Gyárfás[5], a mathematician[13], b. 1945[14], of Hungary[15], specialised in combinatorics[16].
Why It Matters
Erdős–Gyárfás conjecture draws 51 Wikipedia views per month (conjecture category, ranking #20 of 128).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[17]