658 questions

Algorithms for the $k$-admissible matching number of trees

• matching
• combinatorics
• algorithm
• graph-theory
• graph-algorithm

SageMath-x86_64.AppImage on Ubuntu 25.04

• AppImage
• jmol
• plot3d

Eigenvalues changing at only one position

Finding a spanning subgraph that satisfies a given condition

• graphtheory

Groebner basis computation extremely slow

• grobner-basis
• parallelization
• computation_time

Action of symmetric group

• graphs
• symmetric_group
• group_action
• combinatorics

Restricted matchings in simplicial complexes or graphs

• combinatorics
• graphs

Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices

• combinnatoric
• graph-theory
• hypergraphs
• algorithm
• SimplicialComplex

knot theory alternatives to sage?

• knot
• theory
• skein
• plot

460

views

2

answers

no

votes

2025-05-14 07:44:43 +0100 FrédéricC

Output of RootedTrees()

• OrderedTree
• combinatorics
• digraph
• output
• graph-algorithm

144

views

1

answer

1

vote

2025-04-15 19:25:29 +0100 John Palmieri

Having trouble latex the crystal graph using sage, KeyError: 'node_1'?

• graphlatex

How to plot points of a finite plane?

• graphics
• Lines
• plot
• finite
• plane

Consider the class of simple connected bicyclic graphs on $10$ vertices. Let $A$ be the adjacency matrix of any such graph.

Test if a graph is vertex pancyclic

• graph
• graphtheory

Inquiry About GSOC 2025: SageMath Project on Paths and Cycles Enumeration Methods

479

views

1

answer

1

vote

2025-03-06 22:21:16 +0100 Max Alekseyev

How to find the graphs from the following collection whose determinant is maximum?

plotting graphs, vertices on some graphs are very small

L-infinity norm in multivariable function

How to plot this

Plots not showing up for Sage+Python

• 2Dplot
• jupyter-notebook
• ipynb
• vscode

automorphism of a graph

• automorphism
• graphs

Find a perfect bisimplicial ordering in a faster algorithm

• graph
• graph-theory

390

views

1

answer

1

vote

2024-10-25 21:29:46 +0100 FrédéricC

A limit trivial in polar coordinates cannot be computed in Cartesian coordinates. Why ?

• limit

How to make edges Curve with Plot

`legend_label` for 2d scatter plot

• 2Dplot

252

views

no

answers

no

votes

2024-08-30 13:09:19 +0100 rburing

how to get the sagemath programs related to graphs with nodes and edges

Memory leak in is_planar

• memory-leak
• is_planar
• graphs

Is there a way to get the Tait graph from a knot diagram?

• knots
• ask-sage
• snappy
• knot-theory
• laplacian

Does Sage have a function to determine vertex cuts?

• graph-theory

243

views

no

answers

no

votes

2024-07-14 13:47:50 +0100 rewi

Does there exists any simple connected graph $G$ of order $n$, such that whenever $\dfrac{\lambda}{k}$ is an eigenvalue of the adjacency matrix of $G$

• graph-theory