Computational archive for the exclusion of a decomposition of K33 into 51 K5 and 6 K3
收藏资源简介:
This archive contains a case-by-case computational exclusion of a decomposition of the complete graph K33 into 51 copies of K5 and 6 copies of K3. The archive is organized into 10 frozen case folders, corresponding to two K9 triangle patterns (grid and prism) and the five values n3 = 0, 1, 2, 3, 4. Each case folder contains the cleaned rerun pipeline, preserved legacy files used for reconstruction, and frozen summary files:stage_counts.json, final_summary.json, pipeline_manifest.json, file_tree.txt, and checksums.sha256. The cases prism_4n3 and grid_4n3 use the newer fast canonical-skeleton method. The case prism_1n3 is hybrid: the general SAT pipeline leaves two hard residual CNFs (orbit1 dist015, orbit2 dist015), which are excluded by a reduced geometric argument preserved in that folder. The root files MASTER_INDEX.md and MASTER_INDEX.json summarize all frozen cases, and verify_frozen_cases.py checks the integrity and verified-exclusion status of the archive. This upload is intended as the reproducibility archive accompanying a thesis or paper on the exclusion of this K33 decomposition problem. Changelog 20260317 Patched final prism completion scripts to mark fixed K3 triangle edges as already covered before the residual type-1 completion step; reran affected prism cases; regenerated frozen summaries, checksums, and master index.



