Theorems · Theorem · combinatorics
SimpleGraph.IsNClique.not_cliqueFree
∀ {α : Type u_1} {G : SimpleGraph α} {n : ℕ} {s : Finset α}, G.IsNClique n s → ¬G.CliqueFree n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.CliqueFreestatement and proof · cited by 70
- SimpleGraph.IsNCliquestatement and proof · cited by 64
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.IsFiveWheelLike.card_inter_lt_of_cliqueFreeproof · cited by 2
- SimpleGraph.CliqueFree.sup_edgeproof · cited by 2
- SimpleGraph.IsNClique.exists_not_adj_of_cliqueFree_succproof · cited by 1
- SimpleGraph.IsTuranMaximal.card_parts_leproof · cited by 1