Proof of `A class width bound obstructs induced route sampling` (3rd statement)
groundedproofs/Lax263307Proofs/InducedEmbeddingWidth.lean · lax-263307
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Discard long routes and transfer the class width bound to the remaining source graph. Its degrees and edge count cannot increase. Restore deleted edges with the proved edge-deletion bound, then use the definition of treewidth as the minimum admitted decomposition width.