Proof of `Per-Client Fairness Parameters Reduce to a Uniform One` (5th statement)
groundedproofs/Lax117284Proofs/Lemma15Treewidth.lean · lax-117284
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
On an original day two original clients conflict exactly as they did before, on an additional day they never conflict since their unit jobs end at distinct times, and every remaining pair of clients has one of the two new clients in it — so putting both new clients into every bag of a decomposition of the old graph gives a decomposition of the new one, at the price of two in the width.