加入
Four-cycle-free subgraphs of the hypercube
Show that a subgraph of the n-cube with no 4-cycle has at most about half of the cube's edges; the best bound is 0.60318.
比较改动
选两个分支看看改了什么，再发起 PR 把工作带过去。
选两个不同的分支
PR 可以从任何一个分支合入任何另一个分支。
Show that a subgraph of the n-cube with no 4-cycle has at most about half of the cube's edges; the best bound is 0.60318.
选两个分支看看改了什么，再发起 PR 把工作带过去。
PR 可以从任何一个分支合入任何另一个分支。