Proof of `Per-Client Fairness Parameters at Treewidth Four` (2nd statement)
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
The dummy client is required on every day, the two interaction clients on half the edge days each, and every other client once; a client other than those three exists only if the graph has a colour class, and then the instance has a day.