docs: verify reduction #198 — MinimumVertexCover → HamiltonianCircuit#982
Closed
docs: verify reduction #198 — MinimumVertexCover → HamiltonianCircuit#982
Conversation
…t VERIFIED Typst: G&J Theorem 3.4 gadget construction (12-vertex widgets, chain links, selector vertices) + Correctness (⟹ + ⟸) + Extraction + Overhead + YES/NO examples Constructor: 5,782 checks, 0 failures (exhaustive n ≤ 4, 7 sections, widget structure) Adversary: 5,937 checks, 0 failures (independent impl + hypothesis + traversal patterns) Cross-comparison: 244 instances, all agree (vertex/edge counts + VC feasibility) Iteration note: first run found 15 failures on isolated-vertex graphs (K > non-isolated vertices). Fixed by restricting K ≤ n' (standard G&J prerequisite). Re-run: 0 failures. Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## main #982 +/- ##
=======================================
Coverage 98.03% 98.03%
=======================================
Files 784 784
Lines 82310 82310
=======================================
Hits 80695 80695
Misses 1615 1615 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Mathematical verification of the classic Garey & Johnson Theorem 3.4 gadget reduction (VC → HC). This is a complex construction with 12-vertex/14-edge cover-testing widgets, chain links between widgets, and K selector vertices.
Bug found during iteration
First run: 15 failures on graphs with isolated vertices where K > number of non-isolated vertices. The G&J construction requires K ≤ n' (non-isolated vertices) because selectors need vertex chains to traverse. Fixed by adding this as an explicit prerequisite. This is the same edge-case limitation noted in the standard G&J treatment.
Verification Report
Closes #198
🤖 Generated with Claude Code