Theorems · Theorem · combinatorics
Graph.restrict_edgeSet_diff_eq_deleteEdges
Deprecated since 2026-06-03Use Graph.restrict_edgeSet_sdiff_eq_deleteEdges instead.
∀ {α : Type u_1} {β : Type u_2} (G : Graph α β) (F : Set β), G.restrict (G.edgeSet \ F) = G.deleteEdges FAlias of Graph.restrict_edgeSet_sdiff_eq_deleteEdges.
- Defined in
- Mathlib.Combinatorics.Graph.Delete
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 62 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.
- Setstatement · cited by 53,352
- Graphstatement · cited by 242
- Graph.edgeSetstatement · cited by 79
- Graph.restrictstatement · cited by 18
- Graph.deleteEdgesstatement · cited by 12
- Graph.restrict_edgeSet_sdiff_eq_deleteEdgesproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.