Theorems · Theorem · combinatorics
SimpleGraph.card_edgeFinset_completeEquipartiteGraph
∀ {r t : ℕ}, (SimpleGraph.completeEquipartiteGraph r t).edgeFinset.card = r.choose 2 * t ^ 2- Cited by
- 0 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites26
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- Finset.sumproof · cited by 5,195
- Finset.univproof · cited by 3,473
- SimpleGraphstatement · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- mul_commproof · cited by 2,262
- mul_assocproof · cited by 1,667
- Fintype.cardproof · cited by 1,386
- Sym2statement · cited by 737
- Nat.choosestatement and proof · cited by 494
- smul_eq_mulproof · cited by 357
- Fintype.card_finproof · cited by 270
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.