#11584: DegreeSequences class !
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: sage-combinat
Type: PLEASE CHANGE | Status: new
Priority: major | Milestone: sage-4.7.2
Component: combinatorics | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
This patch implements the ``DegreeSequence`` class which lets the user
check whether a given integer sequence is indeed a degree sequence, and
more importantly build the list of all degree sequences of length n.
I originally wrote this code because I attempted to test a conjecture on
"all graphs up to isomorphism", to notice later that there actually was a
*large* number of them. There actually was a nice upper bound on what I
wanted to measure which only depended on the degree sequence, and here I
am.
While it is already hard to enumerate all the graphs on 10 elements, with
this code I was able to enumerate the degree sequences on up to 23
vertices (it has been running on the case 24 for two days now) `:-D`
I also spent a scary amount of time on the documentation, so as to explain
how everything works. Let's make Sage's reference manual a math book `:-D`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11584>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
