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
IncidenceStructure.is_uniform, is_regular, and complement #18986
Milestone
Comments
Commit: |
Branch: u/ncohen/18986 |
New commits:
|
comment:2
LGTM |
Reviewer: Dima Pasechnik |
comment:3
How would I use
thanks, |
comment:4
I tried
and got
|
comment:5
Replying to @dimpase:
Oh, I see, it must be |
Changed branch from u/ncohen/18986 to |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Three methods that we miss. One of them seems to be useful for #18972.
I have been trying to find a way for those methods to tell you at the same time if a hypergraph is
k
uniform, and the value ofk
. There is an unfortunate corner-case, but I still think that it is the best way to implement it.Nathann
CC: @dimpase @videlec
Component: combinatorial designs
Author: Nathann Cohen
Branch/Commit:
55f934b
Reviewer: Dima Pasechnik
Issue created by migration from https://trac.sagemath.org/ticket/18986
The text was updated successfully, but these errors were encountered: