Theorems · Definition · combinatorics
SimpleGraph.Subgraph.deleteVerts
{V : Type u} → {G : SimpleGraph V} → G.Subgraph → Set V → G.SubgraphGiven a subgraph and a set of vertices, delete all the vertices from the subgraph, if present. Any edges incident to the deleted vertices are deleted as well.
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsproof · cited by 210
- SimpleGraph.Subgraph.induceproof · cited by 33
Cited by18
Results whose statement or proof uses this declaration.
- SimpleGraph.deleteUniversalVertsproof · cited by 6
- SimpleGraph.IsTutteViolatorproof · cited by 6
- SimpleGraph.IsTutteViolator.emptyproof · cited by 1
- SimpleGraph.IsTutteViolator.monoproof · cited by 1
- SimpleGraph.not_isTutteViolator_of_isPerfectMatchingproof · cited by 1
- SimpleGraph.ConnectedComponent.odd_matches_node_outsidestatement and proof · cited by 1
- SimpleGraph.exists_isTutteViolatorproof · cited by 1
- SimpleGraph.Subgraph.deleteVerts_emptystatement · cited by 1
- SimpleGraph.Subgraph.deleteVerts_mono'statement and proof · cited by 1
- SimpleGraph.Subgraph.coeDeleteVertsIsostatement and proof · cited by 0
- SimpleGraph.Subgraph.deleteVerts_adjstatement · cited by 0
- SimpleGraph.Subgraph.deleteVerts_antistatement · cited by 0