-
Notifications
You must be signed in to change notification settings - Fork 381
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/SimpleGraph): lemmas for IsMatching #12960
Conversation
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
Supporting lemma's for deducing a subgraph is a matching. Added in preparation for Tutte's theorem.
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.
Style and shorten.
Co-authored-by: Rida Hamadani <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
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.
Nice now!
maintainer merge
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
Taking into account Yaël comments LGTM, thanks! bors d+ |
✌️ pimotte can now approve this pull request. To approve and merge a pull request, simply reply with |
Co-authored-by: Yaël Dillies <[email protected]>
bors r+ |
Supporting lemmas for deducing that a subgraph is a matching. Added in preparation for Tutte's theorem. Co-authored-by: Yaël Dillies <[email protected]> Co-authored-by: Rida Hamadani <[email protected]> Co-authored-by: Pim Otte <[email protected]>
Pull request successfully merged into master. Build succeeded: |
Supporting lemmas for deducing that a subgraph is a matching.
Added in preparation for Tutte's theorem.
This is in preparation for Tutte's theorem. My (partially complete) approach can be found here