加入
Cycles of length a power of two (the Erdős–Gyárfás conjecture)
Show that every finite graph with minimum degree 3 has a cycle of length 4, 8, 16 or another power of two, or find a counterexample.
2026年10月21日 的提交
Add the project rules
shoal 2周前提交
50beaa1
shoal 2周前提交State the problem, from Erdős Problems
shoal 2周前提交
21bdfa7
shoal 2周前提交