Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Subgraph.coeDeleteVertsIso

{V : Type u} →
  {G : SimpleGraph V} →
    {G' : G.Subgraph} → (s : Set V) → (G'.deleteVerts s).coe ≃g SimpleGraph.induce {v | ↑v ∉ s} G'.coe

Equivalence between a subgraph with deleted vertices and its corresponding simple graph.

Defined in
Mathlib.Combinatorics.SimpleGraph.Subgraph
Cited by
0 results in Mathlib
Foundations
Depth 15 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 53352SetSet.Elem · cited by 7166Set.ElemSet.ofPred · cited by 6101Set.ofPredSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.verts · cited by 210Subgraph.vertsSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.Subgraph.coe · cited by 89Subgraph.coeSimpleGraph.induce · cited by 80SimpleGraph.induceSimpleGraph.Subgraph.deleteVerts · cited by 15Subgraph.deleteVertsSubgraph.coeDeleteVertsIsoCITED 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.