Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsFiveWheelLike.notMem_right

∀ {α : Type u_1} [inst : DecidableEq α] {G : SimpleGraph α} {r k : ℕ} {v w₁ w₂ : α} {s t : Finset α},
  G.IsFiveWheelLike r k v w₁ w₂ s t → v ∉ t
Defined in
Mathlib.Combinatorics.SimpleGraph.FiveWheelLike
Cited by
2 results in Mathlib
Foundations
Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.IsFiveWheelLike.not_colorable_succ · cited by 1IsFiveWheelLike.not_color…SimpleGraph.IsFiveWheelLike.exists_isFiveWheelLike_succ_of_not_adj_le_two · cited by 1IsFiveWheelLike.exists_is…Finset · cited by 13712FinsetSimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsFiveWheelLike · cited by 25SimpleGraph.IsFiveWheelLi…IsFiveWheelLike.notMem_rightCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.