Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsPathGraph3Compl.ne_fst

∀ {α : Type u} {G : SimpleGraph α} {v w₁ w₂ : α}, G.IsPathGraph3Compl v w₁ w₂ → v ≠ w₁
Defined in
Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
Cited by
3 results in Mathlib
Foundations
Depth 4 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.exists_isFiveWheelLike_of_maximal_cliqueFree_not_isCompleteMultipartite · cited by 2SimpleGraph.exists_isFive…SimpleGraph.IsFiveWheelLike.fst_notMem_right · cited by 1IsFiveWheelLike.fst_notMe…SimpleGraph.IsFiveWheelLike.minDegree_le_of_cliqueFree_fiveWheelLikeFree_succ · cited by 1IsFiveWheelLike.minDegree…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsPathGraph3Compl · cited by 12SimpleGraph.IsPathGraph3C…SimpleGraph.IsPathGraph3Compl.adj · cited by 5IsPathGraph3Compl.adjSimpleGraph.IsPathGraph3Compl.not_adj_snd · cited by 2IsPathGraph3Compl.not_adj…IsPathGraph3Compl.ne_fstCITED BYCITES

Cites4

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

Cited by3

Results whose statement or proof uses this declaration.