Theorems · Definition · combinatorics
SimpleGraph.Coloring.colorClasses
{V : Type u} → {G : SimpleGraph V} → {α : Type u_2} → G.Coloring α → Set (Set V)The set containing all color classes.
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Coloringstatement and proof · cited by 44
- Setoid.kerproof · cited by 43
- Setoid.classesproof · cited by 17
Cited by7
Results whose statement or proof uses this declaration.
- SimpleGraph.Coloring.toPartitionproof · cited by 3
- SimpleGraph.Coloring.colorClasses_finitestatement · cited by 1
- SimpleGraph.Coloring.card_colorClasses_lestatement and proof · cited by 1
- SimpleGraph.Coloring.colorClasses_isPartitionstatement · cited by 0
- SimpleGraph.Coloring.toPartition_partsstatement · cited by 0
- SimpleGraph.Coloring.mem_colorClassesstatement · cited by 0
- SimpleGraph.partitionable_iff_colorableproof · cited by 0