feat(Combinatorics/Graph): Add graph deletion operations#35879
feat(Combinatorics/Graph): Add graph deletion operations#35879Jun2M wants to merge 40 commits intoleanprover-community:masterfrom
Conversation
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
PR summary cd8272a9d5Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
This PR/issue depends on: |
|
This pull request has conflicts, please merge |
This PR adds definitions and basic lemmas for deleting edges and vertices from a graph in Mathlib/Combinatorics/Graph/Delete.lean.
It introduces the following operations:
G ↾ F(edgeRestrict): The subgraph of G restricted to the edges in F (vertices are preserved).G \ F(edgeDelete): The subgraph of G with the edges in F deleted.G[X](induce): The subgraph of G induced by the set of vertices X.G - X(vertexDelete): The graph obtained from G by deleting the set of vertices X.These definitions are accompanied by simp lemmas describing their edge sets, incidence relations, and basic properties such as monotonicity.
Co-authored-by: Peter Nelson [email protected]
Graph#26770