#14502: Improvements of hyperbolicity procedures
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
> Why do you add more code ? I don't get it. The fact that there is no
quadruple in the answer to Petersen's graph hyperbolicity is not a problem
as the lower bound is zero. The only problem is that the upper bound is 8
! You just had to test this case before returning the result, didn't you ?
And if you *REALLY* want to return a 4-tuple, take `g.vertices()[:4]` and
return their hyperbolicity, without changing the upper bound. But to me
you could also return `[0,0,0,0]` as a certificate that the hyperbolicity
is at least 0 and it would do, too ... Or even nothing, as it is now. The
only problem was with the upper bound, really !
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14502#comment:18>
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 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-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
