Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Iso.symm

{V : Type u_1} → {W : Type u_2} → {G : SimpleGraph V} → {G' : SimpleGraph W} → G ≃g G' → G' ≃g G

The inverse of a graph isomorphism.

Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
34 results in Mathlib
Foundations
Depth 24 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.Iso.connectedComponentEquiv · cited by 5Iso.connectedComponentEqu…SimpleGraph.isContained_congr · cited by 5SimpleGraph.isContained_c…SimpleGraph.Iso.induce · cited by 3Iso.induceSimpleGraph.Iso.mapEdgeSet · cited by 3Iso.mapEdgeSetSimpleGraph.isTuranMaximal_of_iso · cited by 3SimpleGraph.isTuranMaxima…SimpleGraph.Iso.mapNeighborSet · cited by 3Iso.mapNeighborSetSimpleGraph.Copy.isoToSubgraph · cited by 3Copy.isoToSubgraphSimpleGraph.zarankiewicz_of_fintypeCard_eq · cited by 2SimpleGraph.zarankiewicz_…SimpleGraph.Iso.isContained' · cited by 2Iso.isContained'SimpleGraph.IsCompleteMultipartite.colorable_of_cliqueFree · cited by 2IsCompleteMultipartite.co…SimpleGraph.Iso.connected_iff · cited by 1Iso.connected_iffSimpleGraph.Iso.isAcyclic_iff · cited by 1Iso.isAcyclic_iffSimpleGraph.Iso.reachable_iff · cited by 1Iso.reachable_iffSimpleGraph.overFinIso · cited by 1SimpleGraph.overFinIsoSimpleGraph.Iso.symm_toHom_comp_toHom · cited by 1Iso.symm_toHom_comp_toHomSimpleGraph · cited by 3072SimpleGraphRelIso.symm · cited by 193RelIso.symmSimpleGraph.Iso · cited by 99SimpleGraph.IsoIso.symmCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by43

Results whose statement or proof uses this declaration.