Theorems · Definition · combinatorics
SimpleGraph.Hom.comp
{V : Type u_1} →
{W : Type u_2} →
{X : Type u_3} → {G : SimpleGraph V} → {G' : SimpleGraph W} → {G'' : SimpleGraph X} → G' →g G'' → G →g G' → G →g G''Composition of graph homomorphisms.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 20 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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 and proof · cited by 139
- RelHom.compproof · cited by 7
Cited by26
Results whose statement or proof uses this declaration.
- SimpleGraph.Copy.compproof · cited by 5
- SimpleGraph.Coloring.sumLeftproof · cited by 3
- SimpleGraph.Coloring.sumRightproof · cited by 3
- SimpleGraph.Colorable.mono_leftproof · cited by 2
- SimpleGraph.Copy.range_toSubgraphproof · cited by 2
- SimpleGraph.Iso.symm_toHom_comp_toHomstatement · cited by 1
- SimpleGraph.Subgraph.map_compstatement and proof · cited by 1
- SimpleGraph.Coloring.comapproof · cited by 1
- SimpleGraph.ConnectedComponent.map_compstatement · cited by 1
- SimpleGraph.Coloring.surjOn_of_card_le_isCliqueproof · cited by 1
- SimpleGraph.induceHom_compstatement and proof · cited by 1
- SimpleGraph.recolorOfEmbeddingproof · cited by 1