Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.map_adj
∀ {V : Type u} {W : Type v} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G →g G') (H : G.Subgraph) (a a_1 : W),
(SimpleGraph.Subgraph.map f H).Adj a a_1 = Relation.Map H.Adj (⇑f) (⇑f) a a_1- Cited by
- 10 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.Adjstatement and proof · cited by 147
- SimpleGraph.Homstatement and proof · cited by 139
- Relation.Mapstatement · cited by 40
- SimpleGraph.Subgraph.mapstatement and proof · cited by 24
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.coeSubgraph_adjproof · cited by 2
- SimpleGraph.isIndContained_iff_exists_iso_subgraphproof · cited by 2
- SimpleGraph.map_singletonSubgraphproof · cited by 1
- SimpleGraph.Subgraph.map_hom_topproof · cited by 1
- SimpleGraph.Subgraph.map_idproof · cited by 1
- SimpleGraph.Subgraph.map_iso_topproof · cited by 1
- SimpleGraph.Subgraph.map_supproof · cited by 1
- SimpleGraph.Subgraph.IsMatching.map_ofLEproof · cited by 1
- SimpleGraph.Walk.adj_toSubgraph_mapLeproof · cited by 0
- SimpleGraph.Subgraph.map_le_iff_le_comapproof · cited by 0