This is ultimately a question for the NetworkX people, since these
functions are just wrapping theirs. I tried
sage: for x in range(100): show(graphs.DegreeSequence([3,3,3,3,3,3],
seed=randint(1,1000000000)))
and I got a hundred planar graphs, and no K_{3,3}.
> First, just something I'm not familiar with - what is the difference
> between DegreeSequence, DegreeSequenceExpected, and
> DegreeSequenceTree? I thought the first and last generate an
> arbitrary graph and a tree (if the degree sequences are possible),
> respectively, but the documentation for the middle one confuses me,
> because it seems to refer to both arbitrary graphs and trees.
You have found a documentation typo. You should fix that and submit a
patch. The difference between the first two and the third is tree-
ness, and the difference between the first two is that normally,
DegreeSequenceExpected doesn't actually return a graph with the given
degree sequence. For example:
sage: G = graphs.DegreeSequenceExpected([3,3,3,3,3,3])
sage: G.degree()
[5, 5, 7, 4, 3, 2]
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups.google.com/group/sage-support
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
