Theorems · Definition · combinatorics
SimpleGraph.cliqueNum
{α : Type u_3} → SimpleGraph α → ℕThe maximum number of vertices in a clique of a graph G.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- Set.ofPredproof · cited by 6,101
- SimpleGraphstatement and proof · cited by 3,072
- SupSet.sSupproof · cited by 954
- SimpleGraph.IsNCliqueproof · cited by 64
Cited by8
Results whose statement or proof uses this declaration.
- SimpleGraph.exists_isNClique_cliqueNumstatement · cited by 5
- SimpleGraph.IsClique.card_le_cliqueNumstatement · cited by 4
- SimpleGraph.maximumClique_card_eq_cliqueNumstatement and proof · cited by 1
- SimpleGraph.cliqueNum_complstatement · cited by 0
- SimpleGraph.cliqueNum_induce_lestatement and proof · cited by 0
- SimpleGraph.cliqueNum_le_chromaticNumberstatement and proof · cited by 0
- SimpleGraph.indepNum_complstatement · cited by 0
- SimpleGraph.maximumClique_existsproof · cited by 0