Theorems · Definition · combinatorics
SimpleGraph.indepNum
{α : Type u_3} → SimpleGraph α → ℕThe maximal number of vertices of an independent set in a graph G.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 5 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.IsNIndepSetproof · cited by 11
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.IsIndepSet.card_le_indepNumstatement · cited by 0
- SimpleGraph.cliqueNum_complstatement · cited by 0
- SimpleGraph.indepNum_complstatement · cited by 0
- SimpleGraph.exists_isNIndepSet_indepNumstatement · cited by 0
- SimpleGraph.maximumIndepSet_card_eq_indepNumstatement · cited by 0