Theorems · Definition · combinatorics
SimpleGraph.Embedding.toHom
{V : Type u_1} → {W : Type u_2} → {G : SimpleGraph V} → {G' : SimpleGraph W} → G ↪g G' → G →g G'An embedding of graphs gives rise to a homomorphism of graphs.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 17 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Homstatement · cited by 139
- SimpleGraph.Embeddingstatement and proof · cited by 41
- RelEmbedding.toRelHomproof · cited by 15
Cited by25
Results whose statement or proof uses this declaration.
- SimpleGraph.Iso.toHomproof · cited by 13
- SimpleGraph.Embedding.toCopyproof · cited by 7
- SimpleGraph.Walk.boxProdLeftproof · cited by 4
- SimpleGraph.Walk.boxProdRightproof · cited by 4
- SimpleGraph.Coloring.sumLeftproof · cited by 3
- SimpleGraph.Coloring.sumRightproof · cited by 3
- SimpleGraph.Path.mapEmbeddingproof · cited by 2
- SimpleGraph.induce_connected_of_patchesproof · cited by 2
- SimpleGraph.Preconnected.sum_sup_edgeproof · cited by 1
- SimpleGraph.ConnectedComponent.maximal_connected_induce_suppproof · cited by 1
- SimpleGraph.Coloring.surjOn_of_card_le_isCliqueproof · cited by 1
- SimpleGraph.Reachable.sum_sup_edgeproof · cited by 1