SimpleGraph.Hom

{V : Type u_1} → {W : Type u_2} → SimpleGraph V → SimpleGraph W → Type (max u_1 u_2)

A graph homomorphism is a map on vertex sets that respects adjacency relations. The notation G →g G' represents the type of graph homomorphisms.

Defined in: Mathlib.Combinatorics.SimpleGraph.Maps
Cited by: 139 results in Mathlib
Foundations: Depth 2 from the axioms, rests on 4 definitions · uses no axioms

Around this declaration

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

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

Results whose statement or proof uses this declaration.