Theorems · Definition · combinatorics
SimpleGraph.CompleteBipartiteGraph.bicoloring
(V : Type u_4) → (W : Type u_5) → (completeBipartiteGraph V W).Coloring Bool
The bicoloring of a complete bipartite graph using whether a vertex is on the left or on the right.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraph.Coloringstatement · cited by 44
- completeBipartiteGraphstatement · cited by 16
- SimpleGraph.Coloring.mkproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.CompleteBipartiteGraph.chromaticNumberproof · cited by 0