feat(Combinatorics): define undirected hypergraphs#28613
feat(Combinatorics): define undirected hypergraphs#28613espottesmith wants to merge 61 commits intoleanprover-community:masterfrom
Conversation
to need to reimplement a lot of stuff
PR summary 2e36a1dbb4Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
This pull request has conflicts, please merge |
|
Just to note that this is marked awaiting-author for the comments above, once those are fixed you can remove the tag by commenting "-awaiting-author". |
jt496
left a comment
There was a problem hiding this comment.
This looks good. It will be great to have Hypergraphs in mathlib!
I know this was already raised but I also prefer "edgeSet" to "hyperedgeSet" on the basis that "hyperedges" are almost always referred to as "edges" and it will make theorem names a little shorter. (Also why E(H) if they are hyperedges?)
|
Thanks for the heads up, @b-mehta. I still wanted to look a bit more deeply into using And thanks for your comments, @jt496. I disagree that hyperedges are usually called edges (at least in the papers I read, they're frequently referred to as "hyperedges", even if the |
|
-awaiting-author |
|
This pull request has conflicts, please merge |
|
This pull request has conflicts, please merge |
This PR defines undirected hypergraphs:
In addition to the main definition, some additional definitions and related lemmas are provided:
This implementation is certainly bare-bones. I'm submitting this PR at this point, rather than when my developments are more fleshed out, because there has been some interest in others contributing to hypergraph formalization in mathlib.
In the near future, goals include:
Hypergraph αtoMatrix α (Set α) βSet αrather than some other typeβ)