Proof of `A low-degree well-linked core`
groundedproofs/Lax17Proofs/Exposed.lean · lax-17
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
A sufficiently long strong path-of-sets system yields a subcubic subgraph in which its first left interface is still polylogarithmically well-linked.