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