#8404: Computing a H-minor
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by jason):
Replying to [comment:10 dimpase]:
> And, apart from planarity (planarity is easy algorithmically, so it has
only theoretical interest here), few other real problems involving graph
minors.
> And if the code cannot do anything useful, it should not be included in
Sage (not in the standard or optional part, anyway)
>
*I'm* interested in it. In some of my research in graph parameters
(minimum rank of graphs), there are some nice bounds written in terms of
the minors of a graph. Even if it only works for graphs up to 20
vertices, it would be interesting to me and others working in this area
(minimum rank of graphs) so that we could quickly compute small examples.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8404#comment:11>
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.
