Theorems · Theorem · combinatorics
Graph.vertexSet_deleteVerts
∀ {α : Type u_1} {β : Type u_2} (G : Graph α β) (X : Set α), (G.deleteVerts X).vertexSet = G.vertexSet \ X- Defined in
- Mathlib.Combinatorics.Graph.Delete
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 19 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.vertexSetstatement and proof · cited by 87
- Graph.induceproof · cited by 8
- Graph.deleteVertsstatement · cited by 5
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.