[Merged by Bors] - feat(Combinatorics/SimpleGraph/Path): representatives of connected components#20024
[Merged by Bors] - feat(Combinatorics/SimpleGraph/Path): representatives of connected components#20024
Conversation
|
messageFile.md |
|
Looks okay to me, but I wonder whether we really want to provide API about some section rather than any section |
|
I think "representant" (French, I'm assuming) is usually written as "representative" in English. |
I've adapted it to this paradigm and added some more lemma's to see how it pans out, and I like the structure, I'm not entirely sure about naming. |
|
Will wait on @b-mehta's opinion |
| /-- A set of vertices represents a set of components if it contains exactly | ||
| one vertex from each component. | ||
| -/ | ||
| structure _root_.Set.Represents (s : Set V) (C : Set (G.ConnectedComponent)) where |
There was a problem hiding this comment.
Hmm, looking at this definition, it doesn't really seem like it's specific to graphs... That is, given a partition of a subset, it's reasonable to define a set of representatives for it. I could, however, believe that this formulation (using connectedComponent rather than an arbitrary partition) is helpful in your application. But it certainly doesn't look like it belongs in SimpleGraph/Path. Can we move this to a subfolder on connected components instead?
There was a problem hiding this comment.
I have done this, but I have also put together #21097 as an alternative. In the past I have made missteps with Quot, and I'm still not really certain on the nuances and design of the Quot/ConnectedComponent situation.
If the alternative makes sense, I wonder if it also makes sense to migrate off supp and use the SetLike instance instead, so feel free to weigh in if you have any thoughts on that:)
There was a problem hiding this comment.
I just noticed we have the SetLike instance I introduced in that PR already for connected components
Is there a particular reason we use .supp explicitly and tend not to rely on this instance?
|
messageFile.md |
|
messageFile.md |
|
Ah, can you merge master to fix the bot? |
PR summary 7e2b7f649cImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
Superseded by #21097 per discussion in the zulip thread linked above |
|
Reopened after Zulip discussion on #21097 landing on it being better to not generalize for now. |
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
YaelDillies
left a comment
There was a problem hiding this comment.
Thanks!
maintainer delegate
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
|
Thanks! bors merge |
…mponents (#20024) Add the concept of a set of representatives of a connected component along with some basic lemma's on it. In preparation for a proof of Tutte's theorem. Co-authored-by: Pim Otte <otte.pim@gmail.com>
|
Pull request successfully merged into master. Build succeeded: |
Add the concept of a set of representatives of a connected component along with some basic lemma's on it.
In preparation for a proof of Tutte's theorem.
Zulip thread on Tutte's
This PR is the result of cleaning up this file which gives some context to how this will be used further.