Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Embedding.map_adj_iff

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G ↪g G') {v w : V},
  G'.Adj (f v) (f w) ↔ G.Adj v w
Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
6 results in Mathlib
Foundations
Depth 13 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.zarankiewicz_of_fintypeCard_eq · cited by 2SimpleGraph.zarankiewicz_…SimpleGraph.Embedding.comap_eq · cited by 2Embedding.comap_eqSimpleGraph.Embedding.map_mem_edgeSet_iff · cited by 1Embedding.map_mem_edgeSet…SimpleGraph.isClique_range_copy_top · cited by 1SimpleGraph.isClique_rang…SimpleGraph.Embedding.apply_mem_neighborSet_iff · cited by 1Embedding.apply_mem_neigh…SimpleGraph.cliqueFree_completeMultipartiteGraph · cited by 0SimpleGraph.cliqueFree_co…DFunLike.coe · cited by 62936DFunLike.coeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Embedding · cited by 41SimpleGraph.EmbeddingRelEmbedding.map_rel_iff · cited by 25RelEmbedding.map_rel_iffEmbedding.map_adj_iffCITED 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.