Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.deleteVerts_empty

∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph}, G'.deleteVerts ∅ = G'
Defined in
Mathlib.Combinatorics.SimpleGraph.Subgraph
Cited by
1 results in Mathlib
Foundations
Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsTutteViolator.empty · cited by 1IsTutteViolator.emptySet · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.induce · cited by 33Subgraph.induceSet.sdiff_empty · cited by 25Set.sdiff_emptySimpleGraph.Subgraph.deleteVerts · cited by 15Subgraph.deleteVertsSimpleGraph.Subgraph.induce_self_verts · cited by 2Subgraph.induce_self_vertsSubgraph.deleteVerts_emptyCITED BYCITES

Cites7

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

Cited by1

Results whose statement or proof uses this declaration.