English

A 3-semi-perfect 1-factorization of the six-dimensional hypercube

Combinatorics 2026-07-17 v1

Abstract

For a 1-factorization F={M1,,Md}F=\{M_1,\ldots,M_d\} of the hypercube QdQ_d, let G[F]G[F] have vertex set FF, with MiMjM_iM_j an edge exactly when MiMjM_i\cup M_j is a Hamilton cycle. Behague proved that Qk+Q_{k+\ell} has a 1-factorization FF with G[F]Kk,G[F]\cong K_{k,\ell} for all positive k,k,\ell except possibly k==3k=\ell=3. We give an explicit 1-factorization of Q6Q_6 for which G[F]K3,3G[F]\cong K_{3,3}, resolving the exceptional case. The construction is supplied as a finite certificate. Its correctness can be checked directly from the tables in the paper or by either of two independent, short, standard-library verifiers supplied with the certificate.

Cite

@article{arxiv.2607.15609,
  title  = {A 3-semi-perfect 1-factorization of the six-dimensional hypercube},
  author = {Guillaume Lambard},
  journal= {arXiv preprint arXiv:2607.15609},
  year   = {2026}
}

Comments

5 pages. The certificate, two independent Python verifiers, hashes, reproduction instructions, and complete search provenance are archived at https://doi.org/10.5281/zenodo.21404470. Source repository: https://github.com/GLambard/q6-semi-perfect-factorization