Proof of `Day-Independent Due Dates and Processing Times` (3rd 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 clique number of a day's conflict graph is its chromatic number, the graph being an interval graph.