Theorems · Theorem · combinatorics
SimpleGraph.IsFiveWheelLike.fst_notMem_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 → w₁ ∉ t- Cited by
- 1 results in Mathlib
- Foundations
- Depth 55 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.
Cites10
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.mem_insert_selfproof · cited by 128
- Finset.mem_insert_of_memproof · cited by 109
- SimpleGraph.IsFiveWheelLikestatement and proof · cited by 25
- SimpleGraph.IsNClique.isCliqueproof · cited by 14
- SimpleGraph.IsFiveWheelLike.isPathGraph3Complproof · cited by 4
- SimpleGraph.IsFiveWheelLike.isNClique_rightproof · cited by 3
- SimpleGraph.IsPathGraph3Compl.ne_fstproof · cited by 3
- SimpleGraph.IsPathGraph3Compl.not_adj_fstproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.IsFiveWheelLike.snd_notMem_leftproof · cited by 1