Theorems · Theorem · combinatorics
SimpleGraph.CliqueFree.mono
∀ {α : Type u_1} {G : SimpleGraph α} {m n : ℕ}, m ≤ n → G.CliqueFree m → G.CliqueFree n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 4 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.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- 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
- SimpleGraph.CliqueFreestatement and proof · cited by 70
- 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
- SimpleGraph.IsClique.subsetproof · cited by 4
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_le_cardproof · cited by 3
- SimpleGraph.CliqueFree.sup_edgeproof · cited by 2
- SimpleGraph.completeMultipartiteGraph.colorable_of_cliqueFreeproof · cited by 1
- SimpleGraph.IsTuranMaximal.card_parts_leproof · cited by 1