#11735: Bug in is_chordal
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: tbd
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Comment(by dcoudert):
OK, the previous example is not correct (long day). But that one should be
correct. I want to create a cycle of triangles. This should be chordal...
{{{
sage: N = 50
sage: NN = 2*N
sage: L = [(2*i, (2*i+1) % NN) for i in xrange(N)] + [(2*i, (2*i+2)%NN)
for i in xrange(N)] + [((2*i+1)%NN, (2*i+2)%NN) for i in xrange(N)]
sage: G = Graph()
sage: G.add_edges(L)
sage: G.is_chordal()
False
}}}
Nathann, am I right this time ?
D.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11735#comment:7>
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.
