Theorems · Theorem · combinatorics
SimpleGraph.IsContained.vertexCoverNum_le_vertexCoverNum
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W},
G.IsContained H → G.vertexCoverNum ≤ H.vertexCoverNum- Cited by
- 3 results in Mathlib
- Foundations
- Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setproof · cited by 53,352
- ENatstatement and proof · cited by 4,985
- Set.preimageproof · cited by 4,946
- SimpleGraphstatement and proof · cited by 3,072
- Compl.complproof · cited by 2,925
- le_reflproof · cited by 2,061
- SimpleGraph.Adjproof · cited by 1,346
- le_imp_le_of_le_of_leproof · cited by 576
- Set.encardproof · cited by 327
- SimpleGraph.Homproof · cited by 139
- IsAntichainproof · cited by 105
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.vertexCoverNum_monoproof · cited by 0
- SimpleGraph.vertexCoverNum_le_vertexCoverNum_of_injectiveproof · cited by 0
- SimpleGraph.vertexCoverNum_congrproof · cited by 0