Theorems · Definition · combinatorics
SimpleGraph.CliqueFreeOn
{α : Type u_1} → SimpleGraph α → Set α → ℕ → PropG.CliqueFreeOn s n means that G has no n-cliques contained in s.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Finsetproof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.IsNCliqueproof · cited by 64
Cited by11
Results whose statement or proof uses this declaration.
- SimpleGraph.CliqueFreeOn.subsetstatement and proof · cited by 0
- SimpleGraph.CliqueFree.cliqueFreeOnstatement · cited by 0
- SimpleGraph.cliqueFreeOn_emptystatement · cited by 0
- SimpleGraph.cliqueFreeOn_of_card_ltstatement · cited by 0
- SimpleGraph.cliqueFreeOn_singletonstatement · cited by 0
- SimpleGraph.cliqueFreeOn_twostatement and proof · cited by 0
- SimpleGraph.cliqueFreeOn_univstatement · cited by 0
- SimpleGraph.CliqueFreeOn.antistatement and proof · cited by 0
- SimpleGraph.CliqueFreeOn.monostatement and proof · cited by 0
- SimpleGraph.CliqueFreeOn.of_succstatement and proof · cited by 0
- SimpleGraph.cliqueFree_induce_iffstatement and proof · cited by 0