Theorems · Theorem · combinatorics
SimpleGraph.cliqueSet_map_of_equiv
∀ {α : Type u_1} {β : Type u_2} (G : SimpleGraph α) (e : α ≃ β) (n : ℕ),
(SimpleGraph.map (⇑e) G).cliqueSet n = Finset.map e.toEmbedding '' G.cliqueSet n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- Equivstatement and proof · cited by 8,337
- Set.imagestatement and proof · cited by 5,609
- Set.rangeproof · cited by 4,705
- Equiv.symmproof · cited by 3,681
- SimpleGraphstatement and proof · cited by 3,072
- Set.extproof · cited by 2,266
- eq_or_neproof · cited by 1,117
- Finset.mapstatement and proof · cited by 747
- Equiv.apply_symm_applyproof · cited by 346
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.cliqueFinset_map_of_equivproof · cited by 0