Theorems · Theorem · combinatorics
SimpleGraph.isNClique_iff
∀ {α : Type u_1} (G : SimpleGraph α) {n : ℕ} {s : Finset α}, G.IsNClique n s ↔ G.IsClique ↑s ∧ s.card = n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 55 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
- SetLike.coestatement and proof · cited by 8,199
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- SimpleGraph.IsCliquestatement and proof · cited by 76
- SimpleGraph.IsNCliquestatement and proof · cited by 64
- SimpleGraph.IsNClique.card_eqproof · cited by 17
- SimpleGraph.IsNClique.isCliqueproof · cited by 14
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.isNClique_bot_iffproof · cited by 1
- SimpleGraph.isNClique_map_copy_topproof · cited by 1
- SimpleGraph.isNClique_map_iffproof · cited by 1
- SimpleGraph.isNIndepSet_complproof · cited by 0
- SimpleGraph.IsNClique.of_induceproof · cited by 0