Theorems · Theorem · combinatorics
SimpleGraph.completeEquipartiteGraph.isCompleteMultipartite
∀ {r t : ℕ}, (SimpleGraph.completeEquipartiteGraph r t).IsCompleteMultipartite- Cited by
- 0 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphproof · cited by 3,072
- SimpleGraph.IsCompleteMultipartitestatement and proof · cited by 14
- SimpleGraph.completeEquipartiteGraphstatement · cited by 12
- SimpleGraph.completeEquipartiteGraph_eq_bot_iffproof · cited by 2
- SimpleGraph.bot_isCompleteMultipartiteproof · cited by 1
- SimpleGraph.completeEquipartiteGraph.completeMultipartiteGraphproof · cited by 1
- SimpleGraph.isCompleteMultipartite_iffproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.