Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.29127

C4-Free Subgraphs of the Hypercubes Q6, Q7, and Q8: Odd Squares, Fully Frustrated Models, and Computational Structure

Minamo Minamoto
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study C_4-free subgraphs of the hypercubes Q_6, Q_7 and Q_8. Writing g(n) for the maximum size of an odd-square edge set -- meeting every 4-cycle of Q_n in exactly one or three edges -- we prove g(6)=132, g(7)=304, g(8)=682, with explicit machine-verifiable certificates, giving ex(Q_7,C_4)>=304 and ex(Q_8,C_4)>=682. Under the standard fully-frustrated-hypercube correspondence, these values are already implicit in the statistical-physics literature: the field identity and its optimal values go back to Derrida, Pomeau, Toulouse and Vannimenus (1979), who construct ground states for D<=7; the D=8 attainment was reported by Marinari, Parisi and Ritort (1995); Laplante et al. treat the graph-theoretic formulation directly. Our contribution is accordingly narrow: a short self-contained proof of the optima via a mod-8 refinement of the classical two-point inequality, the certificates themselves, and an exhaustive decision of the realisability of the optimal n=6 field distributions, settling a question DPTV left open in 1979: exactly one of the three optimal distributions is realisable. Independently, we classify the 19,866 previously released 304-edge C_4-free subgraphs of Q_7 (389 of them odd-square) into 20 dimension-profile types, establish their common structural core (degree sequence {4^32,5^96}), and decompose them into 180 Aut(Q_7)-orbits containing 34,227,200 labelled solutions; whether these are all orbits of 304-edge solutions is open. For Q_6, ex(Q_6,C_4)=132 rests on Harborth-Nienborg's upper bound, not independently verified here; the odd-square g(6)=132 is self-contained. All certified or deterministic claims are re-checkable from the released code and data; imported results are marked as such, and the repository carries SHA-256 manifests. Edge lists and code: https://github.com/minamominamoto/c4free-hypercube

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Minamo Minamoto. 2026-08-28. C4-Free Subgraphs of the Hypercubes Q6, Q7, and Q8: Odd Squares, Fully Frustrated Models, and Computational Structure. https://arxiv.org/abs/2603.29127

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗