Proof of `Edge-sublinear separators imply edge-sublinear decomposition bags` (2nd 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.
Description
Round separator sizes up to a monotone positive integer bound, and recurse on balanced components. Delete isolated vertices first so the recursive order is at most twice the edge count, then restore their singleton bags. The inequality log x ≤ x^epsilon/epsilon absorbs depth at exponent beta=(1+b)/2, still below one.