Theorems · Theorem · combinatorics
SimpleGraph.CliqueFreeOn.anti
∀ {α : Type u_1} (G H : SimpleGraph α) {s : Set α} {n : ℕ}, G ≤ H → H.CliqueFreeOn s n → G.CliqueFreeOn s n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- SimpleGraph.CliqueFreeOnstatement and proof · cited by 11
- SimpleGraph.IsNClique.monoproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.