While this submission is a draft, it cannot be used by other submissions.

Proof of `Edge-sublinear separators imply edge-sublinear decomposition bags` (1st statement)

groundedproofs/Lax263307Proofs/EdgeBagBounds.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.

Read the Lean proof on GitHub

Description

Choose a positive integer a with a(1-beta)>1. Raise the sublinear bag bound to its a-th power, enlarge the constant to a positive integer A, and use a*beta≤a-1 and m+1≥1 to bound the remaining real power.