Theorems · Definition · combinatorics
SimpleGraph.Iso.toEmbedding
{V : Type u_1} → {W : Type u_2} → {G : SimpleGraph V} → {G' : SimpleGraph W} → G ≃g G' → G ↪g G'An isomorphism of graphs gives rise to an embedding of graphs.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses Quot.sound
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.Isostatement and proof · cited by 99
- SimpleGraph.Embeddingstatement · cited by 41
- RelIso.toRelEmbeddingproof · cited by 34
Cited by11
Results whose statement or proof uses this declaration.
- SimpleGraph.Iso.toHomproof · cited by 13
- SimpleGraph.Iso.toCopyproof · cited by 7
- SimpleGraph.zarankiewicz_of_fintypeCard_eqproof · cited by 2
- SimpleGraph.Iso.isIndContainedproof · cited by 2
- SimpleGraph.Iso.toEmbedding_completeGraphstatement · cited by 0
- SimpleGraph.Iso.toEmbedding_sumCongrstatement · cited by 0
- SimpleGraph.neighborSet_map_equivproof · cited by 0
- SimpleGraph.Iso.reindex_adjMatrixproof · cited by 0
- SimpleGraph.Embedding.sum_comp_sumCommstatement · cited by 0
- SimpleGraph.Embedding.sum_sum_comp_sumAssocstatement · cited by 0
- SimpleGraph.Iso.image_neighborSetproof · cited by 0