Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Iso.map

{V : Type u_1} → {W : Type u_2} → (f : V ≃ W) → (G : SimpleGraph V) → G ≃g SimpleGraph.map (⇑f) G

Given a bijective function, there is an isomorphism from a graph into the mapped graph.

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

Around this declaration

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

SimpleGraph.extremalNumber_of_fintypeCard_eq · cited by 3SimpleGraph.extremalNumbe…SimpleGraph.zarankiewicz_of_fintypeCard_eq · cited by 2SimpleGraph.zarankiewicz_…SimpleGraph.Iso.map_apply · cited by 0Iso.map_applySimpleGraph.Iso.map_symm_apply · cited by 0Iso.map_symm_applySimpleGraph.neighborSet_map_equiv · cited by 0SimpleGraph.neighborSet_m…SimpleGraph.zarankiewicz_le_extremalNumber · cited by 0SimpleGraph.zarankiewicz_…DFunLike.coe · cited by 62936DFunLike.coeEquiv · cited by 8337EquivSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.map · cited by 49SimpleGraph.mapIso.mapCITED BYCITES

Cites5

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

Cited by6

Results whose statement or proof uses this declaration.