-
Notifications
You must be signed in to change notification settings - Fork 299
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Merged by Bors] - feat(combinatorics/simple_graph/basic): edge deletion #11054
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can you use this to give the has_compl
instance rather than something ad-hoc there?
Co-authored-by: Bhavik Mehta <bhavikmehta8@gmail.com>
I'm not sure what the right |
Ah sorry, I was thinking of |
@b-mehta It turns out everything is better in terms of just edge deletion on simple graphs themselves, so it's switched over to that. I thought about using |
Great! What about the opposite, ie using this to implement |
@b-mehta Ok, I added |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
lgtm
bors merge
Function to delete edges from a simple graph, and some associated lemmas. Also defines `sym2.to_rel` as an inverse to `sym2.from_rel`.
Pull request successfully merged into master. Build succeeded: |
Function to delete edges from a simple graph, and some associated lemmas. Also defines `sym2.to_rel` as an inverse to `sym2.from_rel`.
Function to delete edges from a simple graph, and some associated lemmas.
Also defines
sym2.to_rel
as an inverse tosym2.from_rel
.