Is it true that every graph whose vertices have odd degree greater than one contains a cycle of length 2^(n) for some n
Statement
Erdős-Gyárfás: Is it true that every graph whose vertices have odd degree greater than one contains a cycle of length 2^(n) for some n? This one has kept me (and apparently, lots of others) up many a night trying fruitlessly to construct a counterexample. See this.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.