Theorems · Inductive type · combinatorics
SimpleGraph.IsNClique
{α : Type u_1} → SimpleGraph α → ℕ → Finset α → PropAn n-clique in a graph is a set of n vertices which are pairwise connected.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 64 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- SimpleGraphstatement · cited by 3,072
Cited by74
Results whose statement or proof uses this declaration.
- SimpleGraph.CliqueFreeproof · cited by 70
- SimpleGraph.cliqueFinsetproof · cited by 26
- SimpleGraph.cliqueSetproof · cited by 18
- SimpleGraph.IsNClique.card_eqstatement and proof · cited by 17
- SimpleGraph.IsNClique.isCliquestatement and proof · cited by 14
- SimpleGraph.CliqueFreeOnproof · cited by 11
- SimpleGraph.LocallyLinearproof · cited by 9
- SimpleGraph.cliqueNumproof · cited by 8
- SimpleGraph.isNClique_iffstatement and proof · cited by 5
- SimpleGraph.exists_isNClique_cliqueNumstatement and proof · cited by 5
- SimpleGraph.IsNClique.not_cliqueFreestatement and proof · cited by 4
- SimpleGraph.CliqueFree.monoproof · cited by 4