加入
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.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR