TL;DR
This paper establishes new lower bounds for C_4-free subgraphs in hypercubes Q6, Q7, and Q8 using explicit constructions, computational enumeration, and a two-phase simulated annealing algorithm, with results supported by exhaustive verification.
Contribution
It provides the first known explicit constructions and structural analysis for maximum C_4-free subgraphs in Q7 and Q8, and computational methods for these bounds.
Findings
Lower bounds: ex(Q_7,C_4) >= 304 and ex(Q_8,C_4) >= 680.
Explicit constructions certified by exhaustive enumeration.
Structural characterization of solutions in Q_7.
Abstract
We establish new lower bounds ex(Q_7,C_4)>=304 and ex(Q_8,C_4)>=680 for the maximum number of edges in a C_4-free subgraph of the 7- and 8-dimensional hypercubes, and give a modern computational reproduction of ex(Q_6,C_4)=132. All bounds are witnessed by explicit constructions certified by exhaustive enumeration of all four-cycles (240 for Q_6, 672 for Q_7, 1792 for Q_8). For Q_7 we identify 19866 distinct C_4-free subgraphs on 304 edges; their dimension profiles fall into exactly 20 types. All 19866 solutions share a rigid structural core: degree sequence {4^32,5^96}, spectral radius lambda_1 approximately 4.787, and local maximality. Pairwise Hamming distances range from 36 to 260. Whether these solutions exhaust all 304-edge C_4-free subgraphs of Q_7 remains open. For Q_8 we analyse the local structure of the 680-edge construction: every non-edge of the construction creates at least…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
