Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.deleteVerts_adj
∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {s : Set V} {u v : V},
(G'.deleteVerts s).Adj u v ↔ u ∈ G'.verts ∧ u ∉ s ∧ v ∈ G'.verts ∧ v ∉ s ∧ G'.Adj u v- Cited by
- 0 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Subgraph.Adjstatement and proof · cited by 147
- SimpleGraph.Subgraph.induce_adjproof · cited by 17
- SimpleGraph.Subgraph.deleteVertsstatement · cited by 15
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.