Theorems · Theorem · combinatorics

SimpleGraph.cliqueFinset_map

∀ {α : Type u_1} {β : Type u_2} (G : SimpleGraph α) [inst : Fintype α] [inst_1 : DecidableEq α]
  [inst_2 : DecidableRel G.Adj] {n : ℕ} [inst_3 : Fintype β] [inst_4 : DecidableEq β] (f : α ↪ β),
  n ≠ 1 → (SimpleGraph.map (⇑f) G).cliqueFinset n = Finset.map { toFun := Finset.map f, inj' := ⋯ } (G.cliqueFinset 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

Assumes

FintypeDecidableEqDecidableRelFintypeDecidableEq