#16370: OA(k,n) strongly regular graphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.3
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | e469bb5b23d7862b48082f1cba9fd946dd7dc406
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Okay man.... I really need this ticket to make it in, because I have a lot
of useful work above and I don't want to give all this up because of
terminology problems.
I also need a function which returns this OA(k,n) graph, not only because
it is interesting for guys studying graph theory who may want to have more
strongly regular graphs, but also because it is useful in the
constructions.
The theorems I implement these days all begin with "If there exists a
TD(...), a TD(...), a TD(...) then there exists a TD(...)", and so it
appears to me that I need a function which returns "a TD(...)" even though
it may not be unique.
What can I do to get this in ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:34>
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.
