#15495: Flip graph of pure simplicial complex
-----------------------------+--------------------------------------
Reporter: stumpc5 | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.13
Component: combinatorics | Keywords: simplicial complex
Merged in: | Authors: Christian Stump
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+--------------------------------------
For a pure simplicial complex (i.e., a simplicial complex with all maximal
faces (facets) having the same dimension), one can compute the flip graph.
This is the undirected graph with vertices being the facets, where two
facets are jointed by an edge if they meet in a codimension 1 face.
--
Ticket URL: <http://trac.sagemath.org/ticket/15495>
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/groups/opt_out.
