While this submission is a draft, it cannot be used by other submissions.

Proof of `Ordinary fractional coloring` (2nd statement)

groundedproofs/Lax342547Proofs/FractionalColoring.lean · lax-342547

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.

Read the Lean proof on GitHub

Description

Sum the coverage inequalities over vertices, interchange the two finite sums, and use the bound of two on every independent set.