#19586: Add is_cayley_graph
-------------------------------------+-------------------------------------
Reporter: jaanos | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.10
Component: graph theory | Resolution:
Keywords: Cayley graphs | Merged in:
groups | Reviewers:
Authors: Janoš Vidali | Work issues:
Report Upstream: N/A | Commit:
Branch: | 95dfa64264bb0e6ec9122e5ce458a5000d48bc3d
u/jaanos/add_is_cayley_graph | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by dimpase):
I'd investigate whether being more careful with computing subgroups might
help. Perhaps you can use some lower level GAP calls to find a lattice of
transitive subgroups, which ought to be much smaller.
Or you can compute maximal subgroup classes (cf. GAP's
`ConjugacyClassesMaximalSubgroups`), and recurse on these which are
transitive.
--
Ticket URL: <http://trac.sagemath.org/ticket/19586#comment:21>
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.