Skip to content
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

Closed
wants to merge 30 commits into from

Conversation

pimotte
Copy link
Collaborator

@pimotte pimotte commented May 16, 2024

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

Open in Gitpod

@pimotte pimotte added the blocked-by-other-PR This PR depends on another PR to Mathlib (this label is automatically managed by a bot) label May 16, 2024
@pimotte pimotte added the t-combinatorics Combinatorics label May 16, 2024
Copy link
Collaborator

@Rida-Hamadani Rida-Hamadani left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Style and shorten.

@pimotte pimotte requested a review from YaelDillies July 16, 2024 18:41
@YaelDillies YaelDillies added the awaiting-author A reviewer has asked the author a question or requested changes label Jul 16, 2024
@pimotte pimotte removed the awaiting-author A reviewer has asked the author a question or requested changes label Jul 19, 2024
@pimotte pimotte requested a review from YaelDillies July 19, 2024 13:14
@YaelDillies YaelDillies added the awaiting-author A reviewer has asked the author a question or requested changes label Jul 19, 2024
@pimotte pimotte requested a review from YaelDillies July 20, 2024 06:45
Copy link
Collaborator

@YaelDillies YaelDillies left a 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

Copy link

🚀 Pull request has been placed on the maintainer queue by YaelDillies.

@riccardobrasca
Copy link
Member

Taking into account Yaël comments LGTM, thanks!

bors d+

@mathlib-bors
Copy link
Contributor

mathlib-bors bot commented Jul 20, 2024

✌️ pimotte can now approve this pull request. To approve and merge a pull request, simply reply with bors r+. More detailed instructions are available here.

@pimotte
Copy link
Collaborator Author

pimotte commented Jul 21, 2024

bors r+

mathlib-bors bot pushed a commit that referenced this pull request Jul 21, 2024
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]>
@mathlib-bors
Copy link
Contributor

mathlib-bors bot commented Jul 21, 2024

Pull request successfully merged into master.

Build succeeded:

@mathlib-bors mathlib-bors bot changed the title feat(Combinatorics/SimpleGraph): lemmas for IsMatching [Merged by Bors] - feat(Combinatorics/SimpleGraph): lemmas for IsMatching Jul 21, 2024
@mathlib-bors mathlib-bors bot closed this Jul 21, 2024
@mathlib-bors mathlib-bors bot deleted the PO_matching_lemmas branch July 21, 2024 07:01
@adomani adomani mentioned this pull request Aug 1, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
awaiting-author A reviewer has asked the author a question or requested changes delegated maintainer-merge t-combinatorics Combinatorics
Projects
None yet
Development

Successfully merging this pull request may close these issues.

6 participants