Theorems · Theorem · combinatorics
SimpleGraph.complete_graph_degree
∀ {V : Type u_1} [inst : Fintype V] [inst_1 : DecidableEq V] (v : V),
(SimpleGraph.completeGraph V).degree v = Fintype.card V - 1- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- Finset.cardproof · cited by 2,327
- Fintype.cardstatement and proof · cited by 1,386
- Finset.mem_univproof · cited by 361
- SimpleGraph.neighborSetstatement · cited by 257
- Finset.filter_congrproof · cited by 167
- SimpleGraph.degreestatement · cited by 112
- Finset.card_univproof · cited by 58
- SimpleGraph.completeGraphstatement and proof · cited by 49
- Finset.card_erase_of_memproof · cited by 38
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.IsRegularOfDegree.topproof · cited by 3