Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.deleteVerts_deleteVerts

∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (s s' : Set V),
  (G'.deleteVerts s).deleteVerts s' = G'.deleteVerts (s ∪ s')
Defined in
Mathlib.Combinatorics.SimpleGraph.Subgraph
Cited by
0 results in Mathlib
Foundations
Depth 14 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Set · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphSet.ext · cited by 2266Set.extSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.verts · cited by 210Subgraph.vertsSimpleGraph.Subgraph.Adj · cited by 147Subgraph.AdjSimpleGraph.Subgraph.ext · cited by 33Subgraph.extSimpleGraph.Subgraph.induce_adj · cited by 17Subgraph.induce_adjSimpleGraph.Subgraph.induce_verts · cited by 15Subgraph.induce_vertsSimpleGraph.Subgraph.deleteVerts · cited by 15Subgraph.deleteVertsSubgraph.deleteVerts_deleteVe…CITED BYCITES

Cites10

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.