Theorems · Theorem · combinatorics
Graph.IsSubgraph.vertexSet_mono
∀ {α : Type u_1} {β : Type u_2} {H G : Graph α β}, H.IsSubgraph G → H.vertexSet ⊆ G.vertexSet- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.vertexSetstatement · cited by 87
- Graph.IsSubgraphstatement and proof · cited by 12
Cited by12
Results whose statement or proof uses this declaration.
- Graph.IsSubgraph.transproof · cited by 3
- Graph.le_iff_compatible_subset_subsetproof · cited by 1
- Graph.restrict_mono_leftproof · cited by 1
- Graph.le_noEdge_iffproof · cited by 0
- Graph.induce_le_iffproof · cited by 0
- Graph.IsInducedSubgraph.transproof · cited by 0
- Graph.IsSpanningSubgraph.anti_rightproof · cited by 0
- Graph.vertexSet_ssubset_or_edgeSet_ssubset_of_ltproof · cited by 0
- Graph.IsSpanningSubgraph.mono_leftproof · cited by 0
- Graph.IsClosedSubgraph.transproof · cited by 0
- Graph.noEdge_le_iffproof · cited by 0
- Graph.IsSubgraph.antisymmproof · cited by 0