Theorems · Theorem · combinatorics
SimpleGraph.cliqueSet_eq_empty_iff
∀ {α : Type u_1} {G : SimpleGraph α} {n : ℕ}, G.cliqueSet n = ∅ ↔ G.CliqueFree n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.CliqueFreestatement · cited by 70
- SimpleGraph.IsNCliqueproof · cited by 64
- SimpleGraph.cliqueSetstatement · cited by 18
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.CliqueFree.cliqueSetproof · cited by 1