Proof of `Linear Neighbourhood Complexity of Bounded Merge-Width Classes`
groundedproofs/Lax9Proofs/Neighborhood.lean · lax-9
What this proof establishes
no assumptions
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
Theorem 1.5 of Bonamy–Geniet: every graph class of bounded merge-width has linear neighbourhood complexity.