Theorems · Theorem · combinatorics
SimpleGraph.CliqueFreeOn.mono
∀ {α : Type u_1} (G : SimpleGraph α) {s : Set α} {m n : ℕ}, m ≤ n → G.CliqueFreeOn s m → G.CliqueFreeOn s n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 0 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.
Cites14
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
- LE.le.transproof · cited by 3,151
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardproof · cited by 2,327
- Eq.geproof · cited by 375
- Finset.coe_subsetproof · cited by 93
- SimpleGraph.IsNCliqueproof · cited by 64
- SimpleGraph.IsNClique.card_eqproof · cited by 17
- SimpleGraph.IsNClique.isCliqueproof · cited by 14
- Finset.exists_subset_card_eqproof · cited by 13
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.