Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Hom.comap

{V : Type u_1} → {W : Type u_2} → (f : V → W) → (G : SimpleGraph W) → SimpleGraph.comap f G →g G

There is a homomorphism to a graph from a comapped graph. When the function is injective, this is an embedding (see SimpleGraph.Embedding.comap).

Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
2 results in Mathlib
Foundations
Depth 14 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Hom.comap_apply · cited by 0Hom.comap_applySimpleGraph.Hom.comp_comap_ofLE · cited by 0Hom.comp_comap_ofLESimpleGraph · cited by 3072SimpleGraphSimpleGraph.Hom · cited by 139SimpleGraph.HomSimpleGraph.comap · cited by 29SimpleGraph.comapHom.comapCITED 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.