Theorems · Theorem · combinatorics
SimpleGraph.cliqueSet_map
∀ {α : Type u_1} {β : Type u_2} {n : ℕ},
n ≠ 1 → ∀ (G : SimpleGraph α) (f : α ↪ β), (SimpleGraph.map (⇑f) G).cliqueSet n = Finset.map f '' G.cliqueSet n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites30
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 and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Set.imagestatement and proof · cited by 5,609
- Set.preimageproof · cited by 4,946
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardproof · cited by 2,327
- Set.extproof · cited by 2,266
- SimpleGraph.Adjproof · cited by 1,346
- Function.Embeddingstatement and proof · cited by 988
- Finset.mapstatement and proof · cited by 747
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.cliqueSet_map_of_equivproof · cited by 1
- SimpleGraph.EdgeDisjointTriangles.mapproof · cited by 1
- SimpleGraph.cliqueFinset_mapproof · cited by 1