Theorems · Definition · combinatorics
Graph.restrict
{α : Type u_1} → {β : Type u_2} → Graph α β → Set β → Graph α βRestrict G : Graph α β to the edges in a set E₀ without removing vertices
- Defined in
- Mathlib.Combinatorics.Graph.Delete
- Cited by
- 18 results in Mathlib
- Foundations
- Depth 17 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.
- Setstatement and proof · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.vertexSetproof · cited by 87
- Graph.edgeSetproof · cited by 79
Cited by19
Results whose statement or proof uses this declaration.
- Graph.deleteEdgesproof · cited by 12
- Graph.edgeSet_restrictstatement and proof · cited by 7
- Graph.restrict_lestatement · cited by 4
- Graph.vertexSet_restrictstatement and proof · cited by 4
- Graph.restrict_isLinkstatement and proof · cited by 3
- Graph.restrict_edgeSet_interstatement · cited by 1
- Graph.restrict_edgeSet_sdiff_eq_deleteEdgesstatement and proof · cited by 1
- Graph.restrict_inter_edgeSetstatement and proof · cited by 1
- Graph.restrict_mono_leftstatement · cited by 1
- Graph.restrict_mono_rightstatement and proof · cited by 1
- Graph.restrict_restrictstatement and proof · cited by 1
- Graph.restrict_selfstatement · cited by 1