Join
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.
Update from the catalog #1
Merged
+3 −1 scienceslack.json View file
| @@ -19,5 +19,7 @@ | ||
| 19 | 19 | "as_of": "2026-10-20", |
| 20 | 20 | "prize": "$100", |
| 21 | 21 | "catalog": "0521c19bbd38" |
| 22 | - } | |
| 22 | + }, | |
| 23 | + "review": true, | |
| 24 | + "approval": "first-time" | |
| 23 | 25 | } |