Theorems · Theorem · combinatorics
SimpleGraph.CliqueFreeOn.of_succ
∀ {α : Type u_1} (G : SimpleGraph α) {s : Set α} {a : α} {n : ℕ},
G.CliqueFreeOn s (n + 1) → a ∈ s → G.CliqueFreeOn (s ∩ G.neighborSet a) n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- Set.inter_subset_leftproof · cited by 360
- SimpleGraph.neighborSetstatement and proof · cited by 257
- Finset.coe_insertproof · cited by 124
- SimpleGraph.IsNCliqueproof · cited by 64
- Set.insert_subset_iffproof · cited by 35
- SimpleGraph.CliqueFreeOnstatement and proof · cited by 11
- SimpleGraph.IsNClique.insertproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.