Certified length-70 binary (9,1) fixed-backbone theorem: every valid cover uses at most 60 distinct edges of one explicit 64-edge backbone; global bounds unchanged.
reproducible-research coding-theory combinatorics sat-solver computer-assisted-proof de-bruijn-graph de-bruijn-sequences extremal-combinatorics covering-codes covering-sequences
-
Updated
Sep 5, 2026 - Python