Say I have a K_{n,n} and from it I want to extract d mutually disjoint
perfect matchings.
How can this be done?
Hopefully the result can be obtained as a list of list of edges where each
edge is given an integer 2-tuple corresponding to the vertices that this
edge connects.
--
You received this message because you are subscribed to the Google Groups
"sage-support" 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-support.
For more options, visit https://groups.google.com/d/optout.
