Theorems · Theorem · combinatorics
SimpleGraph.mem_cliqueFinset_iff
∀ {α : Type u_1} {G : SimpleGraph α} [inst : Fintype α] [inst_1 : DecidableEq α] [inst_2 : DecidableRel G.Adj] {n : ℕ}
{s : Finset α}, s ∈ G.cliqueFinset n ↔ G.IsNClique n s- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Finset.mem_univproof · cited by 361
- Finset.mem_filterproof · cited by 185
- SimpleGraph.IsNCliquestatement · cited by 64
- SimpleGraph.cliqueFinsetstatement · cited by 26
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.coe_cliqueFinsetproof · cited by 5