Theorems · Theorem · combinatorics
SimpleGraph.isNClique_bot_iff
∀ {α : Type u_1} {n : ℕ} {s : Finset α}, ⊥.IsNClique n s ↔ n ≤ 1 ∧ s.card = n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 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
- Bot.botstatement and proof · cited by 4,720
- SimpleGraphstatement · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- SimpleGraph.IsNCliquestatement · cited by 64
- Finset.card_le_oneproof · cited by 10
- SimpleGraph.isNClique_iffproof · cited by 5
- SimpleGraph.isClique_bot_iffproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.cliqueFree_botproof · cited by 3