Theorems · Definition · combinatorics
SimpleGraph.vertexCoverNum
{V : Type u_1} → SimpleGraph V → ℕ∞The vertex cover number of G is the minimal number of vertices in a vertex cover of G.
- Cited by
- 17 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, 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.
- Setproof · cited by 53,352
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- iInfproof · cited by 1,690
- Set.encardproof · cited by 327
- SimpleGraph.IsVertexCoverproof · cited by 17
Cited by17
Results whose statement or proof uses this declaration.
- SimpleGraph.vertexCoverNum_le_card_sub_onestatement and proof · cited by 3
- SimpleGraph.IsContained.vertexCoverNum_le_vertexCoverNumstatement and proof · cited by 3
- SimpleGraph.vertexCoverNum_botstatement · cited by 3
- SimpleGraph.vertexCoverNum_existsstatement · cited by 3
- SimpleGraph.vertexCoverNum_of_subsingletonstatement and proof · cited by 2
- SimpleGraph.IsVertexCover.vertexCoverNum_lestatement · cited by 2
- SimpleGraph.vertexCoverNum_le_encard_edgeSetstatement and proof · cited by 1
- SimpleGraph.vertexCoverNum_le_iffstatement · cited by 1
- SimpleGraph.vertexCoverNum_ne_top_of_finitestatement · cited by 1
- SimpleGraph.exists_of_le_vertexCoverNumstatement and proof · cited by 1
- SimpleGraph.vertexCoverNum_le_vertexCoverNum_of_injectivestatement · cited by 0
- SimpleGraph.vertexCoverNum_lt_cardstatement · cited by 0