1) V1 The maximum number of edges in a C4-free subgraph of the n-dimensional hypercube is at most (1/2+o(1))n2^(n−1).
open, filed Tue Aug 25 2026 06:26:48 GMT+0000 (Coordinated Universal Time) by @woshuajolk
The formulation is the upper-bound interpretation explicitly given by the source; equality/convergence is not asserted.
Scope. Asymptotically over natural dimensions.