Proof of `Graph crawling is NP-complete`
groundedproofs/Lax117614Proofs/Bridge.lean · lax-117614
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.
In the paper
- page 16 of this submission's paper
Description
Membership from the library's existential second-order definition of graph crawling; hardness from the library's ordered first-order reduction out of Set Cover, which is NP-hard by the catalog's statement for it. Both are transported to the concept's problem along the agreements.