Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.pathGraph3ComplEmbeddingOf

{α : Type u} → {G : SimpleGraph α} → ¬G.IsCompleteMultipartite → (SimpleGraph.pathGraph 3)ᶜ ↪g G

Embedding of (pathGraph 3)ᶜ into G that is not complete-multipartite.

Defined in
Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
Cited by
1 results in Mathlib
Foundations
Depth 51 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsCompleteMultipartite.comap · cited by 0IsCompleteMultipartite.co…SimpleGraph · cited by 3072SimpleGraphCompl.compl · cited by 2925Compl.complSimpleGraph.Embedding · cited by 41SimpleGraph.EmbeddingSimpleGraph.IsCompleteMultipartite · cited by 14SimpleGraph.IsCompleteMul…SimpleGraph.pathGraph · cited by 8SimpleGraph.pathGraphSimpleGraph.IsPathGraph3Compl.pathGraph3ComplEmbedding · cited by 0IsPathGraph3Compl.pathGra…SimpleGraph.pathGraph3ComplEm…CITED BYCITES

Cites6

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

Cited by1

Results whose statement or proof uses this declaration.