#7476: Edge-disjoint spanning trees
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Old description:
> The theorem from Nash-Williams on the existence of k edge-disjoint
> spanning trees in a graph is both important, useful, and polynomial to
> compute. This could be implemented using the short proof described in the
> following article :
>
> http://arxiv.org/abs/0911.2809
>
> Or, if we achieve to eventually define in Sage a class Matroid, this
> could be done through the Matroid Union Theorem as presented in
> Schrijver's book.
>
> This ticket might conflict with #7608. The patch at #7608 makes a lot of
> changes to sage/graphs/generic_graph.py, a module that is also touched by
> ncohen's patch on this ticket.
New description:
The theorem from Nash-Williams on the existence of k edge-disjoint
spanning trees in a graph is both important, useful, and polynomial to
compute. This could be implemented using the short proof described in the
following article :
http://arxiv.org/abs/0911.2809
Or, if we achieve to eventually define in Sage a class Matroid, this could
be done through the Matroid Union Theorem as presented in Schrijver's
book.
--
Comment(by ncohen):
Patch rebased on top of #7608 !
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7476#comment:4>
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.
