Equitable edge-colouring definitions and finite descent #
Equitability means that all colour-class sizes differ by at most one, including unused colours. Minimizing the sum of their squared sizes gives the termination argument for Kempe recolouring. An equitable colouring also has every class bounded by the ceiling of the average size.
All literal colour classes differ in cardinality by at most one.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The square-energy used by alternating-component descent.
Equations
- LeanPool.Vizing.EquitableDefinitions.energy E colour = ∑ a : Color, (LeanPool.Vizing.ColourClasses.colourClass E colour a).card ^ 2
Instances For
The exact arithmetic behind one balancing move. Moving one edge from a
class of size large to a class of size small strictly decreases the
square-energy as soon as the two sizes differ by at least two.
Finite descent is logically separate from the Kempe-component lemma. If every non-equitable proper colouring admits one proper recolouring of smaller energy, then an equitable proper colouring exists. This packages the global termination argument without assuming any graph-theoretic input.
Summing over the whole declared palette counts every literal edge once; unused colours simply contribute zero.
The natural ceiling of the average class size.
Equations
Instances For
Equitability bounds each class by the ceiling of the average size.
A proper edge colouring with a uniform bound on every colour class.
- colour : Sym2 V → Color
The colour assigned to each unordered vertex pair.
- proper : ColourClasses.ProperOn E self.colour
Instances For
Package the class-size bound supplied by an equitable proper colouring.
Equations
- LeanPool.Vizing.EquitableDefinitions.boundedColouringOfEquitable E colour hproper hEq = { colour := colour, proper := hproper, class_card_le := ⋯ }