#18972: twographs and Seidel switching
-------------------------------------+-------------------------------------
Reporter: dimpase | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers: Nathann Cohen
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dimpase/seidelsw | 25eec1b6d18bb021eccd4b04774111097ff8f3b5
Dependencies: #18960, #18948, | Stopgaps:
#18988, #18991, #18986, #19018, |
#19019 |
-------------------------------------+-------------------------------------
Comment (by ncohen):
> This is actually just not true. `is_regular+is_uniform(k=3)` is
equivalent
> to `is_t_design(t=1, k=3)`.
True.
> In fact, all I need `is_uniform(k=3)`, which is equivalent to to
`is_t_design(k=3)`.
It is equivalent in term of answers but not in terms of running time,
though. So please use `T.is_uniform`, whose intent is also much clearer.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/18972#comment:116>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
