Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsClique.map

∀ {α : Type u_1} {β : Type u_2} {G : SimpleGraph α} {s : Set α},
  G.IsClique s → ∀ {f : α ↪ β}, (SimpleGraph.map (⇑f) G).IsClique (⇑f '' s)
Defined in
Mathlib.Combinatorics.SimpleGraph.Clique
Cited by
3 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsNClique.map · cited by 2IsNClique.mapSimpleGraph.isClique_map_iff_of_nontrivial · cited by 2SimpleGraph.isClique_map_…SimpleGraph.isClique_map_finset_iff_of_nontrivial · cited by 1SimpleGraph.isClique_map_…DFunLike.coe · cited by 62936DFunLike.coeSet · cited by 53352SetSet.image · cited by 5609Set.imageSimpleGraph · cited by 3072SimpleGraphFunction.Embedding · cited by 988Function.EmbeddingSimpleGraph.IsClique · cited by 76SimpleGraph.IsCliqueSimpleGraph.map · cited by 49SimpleGraph.mapIsClique.mapCITED BYCITES

Cites7

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

Cited by3

Results whose statement or proof uses this declaration.