Proof of `The Conflict Graphs of an Instance`
groundedproofs/Lax117284Proofs/ExtremeFairness.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
Feasibility forbids exactly the conflicting pairs of a day, which are exactly the edges of that day's conflict graph.