Theorems · Definition · combinatorics
SimpleGraph.Hom.ofLE
{V : Type u_1} → {G₁ G₂ : SimpleGraph V} → G₁ ≤ G₂ → G₁ →g G₂The graph homomorphism from a smaller graph to a bigger one.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 27 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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
Cited by29
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.mapLeproof · cited by 26
- SimpleGraph.Reachable.monoproof · cited by 10
- SimpleGraph.Copy.ofLEproof · cited by 6
- SimpleGraph.reachable_deleteEdges_iff_exists_walkproof · cited by 3
- SimpleGraph.Colorable.mono_leftproof · cited by 2
- SimpleGraph.egirth_antiproof · cited by 1
- SimpleGraph.Subgraph.IsMatching.map_ofLEstatement and proof · cited by 1
- SimpleGraph.ConnectedComponent.surjective_map_ofLEstatement · cited by 1
- SimpleGraph.Walk.transfer_eq_map_ofLEstatement and proof · cited by 1
- SimpleGraph.edist_antiproof · cited by 1
- SimpleGraph.ConnectedComponent.card_le_card_of_leproof · cited by 0
- SimpleGraph.Hom.comp_comap_ofLEstatement · cited by 0