Theorems · Theorem · combinatorics
SimpleGraph.IsFiveWheelLike.card_left
∀ {α : Type u_1} {s : Finset α} {G : SimpleGraph α} {r k : ℕ} [inst : DecidableEq α] {v w₁ w₂ : α} {t : Finset α},
G.IsFiveWheelLike r k v w₁ w₂ s t → s.card = r- Cited by
- 2 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- Finset.card_insert_of_notMemproof · cited by 45
- SimpleGraph.IsFiveWheelLikestatement and proof · cited by 25
- SimpleGraph.IsNClique.card_eqproof · cited by 17
- SimpleGraph.IsFiveWheelLike.isNClique_leftproof · cited by 3
- SimpleGraph.IsFiveWheelLike.notMem_leftproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.IsFiveWheelLike.card_inter_lt_of_cliqueFreeproof · cited by 2
- SimpleGraph.IsFiveWheelLike.card_rightproof · cited by 1