id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
11584,DegreeSequences class !,ncohen,sage-combinat,"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
APPLY:
* [attachment:trac_11584.patch]
* [attachment:trac_11584-doc.patch]",enhancement,closed,major,sage-5.0,graph theory,fixed,,nthiery mvngu rmiller,sage-5.0.beta11,Nathann Cohen,David Coudert,N/A,,,,,