Theorems · Theorem · combinatorics
SimpleGraph.IsFiveWheelLike.card_right
∀ {α : 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 → t.card = r- Cited by
- 1 results in Mathlib
- Foundations
- Depth 62 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.
Cites6
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 · cited by 2,327
- SimpleGraph.IsFiveWheelLikestatement and proof · cited by 25
- SimpleGraph.IsFiveWheelLike.symmproof · cited by 2
- SimpleGraph.IsFiveWheelLike.card_leftproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.IsFiveWheelLike.card_inter_lt_of_cliqueFreeproof · cited by 2