Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

graphs.triangulations(3) cannot return a triangle #37602

Merged
merged 1 commit into from
Mar 31, 2024
Merged

graphs.triangulations(3) cannot return a triangle #37602

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions src/sage/graphs/graph_generators.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2237,6 +2237,12 @@ def triangulations(self, order, minimum_degree=None, minimum_connectivity=None,
sage: g.is_isomorphic(graphs.OctahedralGraph()) # optional - plantri
True

The minimum degree of a triangulation is 3, so the method can not output
a triangle::

sage: list(graphs.triangulations(3)) # optional - plantri
[]

An overview of the number of 5-connected triangulations on up to 22 vertices. This
agrees with :oeis:`A081621`::

Expand Down
Loading