#19123: LatticePoset: add is_vertically_decomposable
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/vertically_decomposable|
ca909a0c05fee489a071ff672b9f3b5392ba8158
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Helloooooooo !
Yeah yeah I guess. Could you just add a link in the doc toward a
textbook/paper that defines it the way you use it?
> (Or raise OtherError("developers don't know how to define this")?
We have had very non-enlightening debates here about whether the empty
graph is connected or not. In such a situation, I would add such a warning
rather than have those stupid conversations `:-P`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19123#comment:15>
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.
For more options, visit https://groups.google.com/d/optout.
