#14099: Adding Method for testing avoidance in posets
---------------------------------------------------+------------------------
Reporter: chrisjamesberg | Owner: rowland
Type: enhancement | Status: new
Priority: minor | Milestone: sage-5.7
Component: combinatorics | Resolution:
Keywords: posets, days45 | Work issues:
Report Upstream: N/A | Reviewers: Chris Berg
Authors: Eric rowland, Alejandro Morales | Merged in:
Dependencies: | Stopgaps:
---------------------------------------------------+------------------------
Comment (by ncohen):
I just created ticket #14122 because of this ticket.
With that ticket, the following code
{{{
mchain = digraphs.Circuit(m+1)
mchain.delete_vertex(m)
nchain = digraphs.Circuit(n+1)
nchain.delete_vertex(n)
return g.transitive_closure().subgraph_search((mchain +
nchain).transitive_closure(), induced = True) is None
}}}
can be replaced by
{{{
twochains = digraphs.Tournament(n) + digraphs.Tournament(m)
return g.transitive_closure().subgraph_search(twochains, induced = True)
is None
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14099#comment:13>
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.
