[Merged by Bors] - feat(Combinatorics/SimpleGraph): part of Tutte's theorem#22119
[Merged by Bors] - feat(Combinatorics/SimpleGraph): part of Tutte's theorem#22119
Conversation
PR summary 8628440bf1
|
| File | Base Count | Head Count | Change |
|---|---|---|---|
| Mathlib.Combinatorics.SimpleGraph.Matching | 936 | 949 | +13 (+1.39%) |
| Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents | 749 | 759 | +10 (+1.34%) |
| Mathlib.Combinatorics.SimpleGraph.UniversalVerts | 941 | 951 | +10 (+1.06%) |
Import changes for all files
| Files | Import difference |
|---|---|
Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents Mathlib.Combinatorics.SimpleGraph.UniversalVerts |
10 |
Mathlib.Combinatorics.SimpleGraph.Matching |
13 |
Mathlib.Combinatorics.SimpleGraph.Tutte (new file) |
952 |
Declarations diff
+ ConnectedComponent.even_ncard_supp_sdiff_rep
+ IsClique.even_iff_exists_isMatching
+ IsMatching.eq_of_adj_left
+ IsMatching.eq_of_adj_right
+ IsTutteViolator
+ IsTutteViolator.empty
+ Subgraph.IsPerfectMatching.exists_of_isClique_supp
+ disjoint_image_val_universalVerts
+ even_ncard_compl_iff
+ even_ncard_image_val_supp_sdiff_image_val_rep_union
+ ncard_eq
+ not_isTutteViolator_of_isPerfectMatching
+ odd_ncard_compl_iff
You can run this locally as follows
## summary with just the declaration names:
./scripts/declarations_diff.sh <optional_commit>
## more verbose report:
./scripts/declarations_diff.sh long <optional_commit>The doc-module for script/declarations_diff.sh contains some details about this script.
No changes to technical debt.
You can run this locally as
./scripts/technical-debt-metrics.sh pr_summary
- The
relativevalue is the weighted sum of the differences with weight given by the inverse of the current value of the statistic. - The
absolutevalue is therelativevalue divided by the total sum of the inverses of the current values (i.e. the weighted average of the differences).
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
|
This PR/issue depends on: |
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
YaelDillies
left a comment
There was a problem hiding this comment.
Just pushed a small golf and suggested another one. Rest looks good to me, thanks!
maintainer delegate
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
b-mehta
left a comment
There was a problem hiding this comment.
This is broadly in good shape, I've left a couple of comments for now. I'll take another look after you've addressed them!
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Bhavik Mehta <bhavikmehta8@gmail.com>
|
Looks good, thank you! bors merge |
Adds three key parts of the proof of Tutte's theorem, with some supporting lemma's: - necessity of the Tutte condition (`not_isTutteViolator`) - the fact that the empty set violates the Tutte condition if the number of vertices is odd (`IsTutteViolator.empty`) - the construction of a perfect matching in a graph that decomposes into cliques (`Subgraph.IsPerfectMatching.exists_of_isClique_supp`) Definitions added: `IsTutteViolator`. Co-authored-by: Pim Otte <otte.pim@gmail.com> Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
|
Build failed (retrying...): |
Adds three key parts of the proof of Tutte's theorem, with some supporting lemma's: - necessity of the Tutte condition (`not_isTutteViolator`) - the fact that the empty set violates the Tutte condition if the number of vertices is odd (`IsTutteViolator.empty`) - the construction of a perfect matching in a graph that decomposes into cliques (`Subgraph.IsPerfectMatching.exists_of_isClique_supp`) Definitions added: `IsTutteViolator`. Co-authored-by: Pim Otte <otte.pim@gmail.com> Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
|
Pull request successfully merged into master. Build succeeded: |
Adds three key parts of the proof of Tutte's theorem, with some supporting lemma's: - necessity of the Tutte condition (`not_isTutteViolator`) - the fact that the empty set violates the Tutte condition if the number of vertices is odd (`IsTutteViolator.empty`) - the construction of a perfect matching in a graph that decomposes into cliques (`Subgraph.IsPerfectMatching.exists_of_isClique_supp`) Definitions added: `IsTutteViolator`. Co-authored-by: Pim Otte <otte.pim@gmail.com> Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Adds three key parts of the proof of Tutte's theorem, with some supporting lemma's:
not_isTutteViolator)IsTutteViolator.empty)Subgraph.IsPerfectMatching.exists_of_isClique_supp)Definitions added:
IsTutteViolator.Zulip thread on Tutte's