Theorems · Theorem · combinatorics
SimpleGraph.card_topEdgeLabeling
∀ {V : Type u_1} {K : Type u_3} [inst : DecidableEq V] [inst_1 : Fintype V] [inst_2 : Fintype K],
Fintype.card (SimpleGraph.TopEdgeLabeling V K) = Fintype.card K ^ (Fintype.card V).choose 2- Cited by
- 0 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintypeFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- Fintypestatement and proof · cited by 7,736
- SimpleGraphstatement · cited by 3,072
- Fintype.cardstatement and proof · cited by 1,386
- Nat.choosestatement and proof · cited by 494
- SimpleGraph.TopEdgeLabelingstatement · cited by 3
- Fintype.card_funproof · cited by 3
- SimpleGraph.edgeFinset_cardproof · cited by 3
- SimpleGraph.card_edgeFinset_top_eq_card_choose_twoproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.