Loading [MathJax]/jax/output/HTML-CSS/jax.js
Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Restricted matchings in simplicial complexes or graphs

Let Δ be a simplicial complex. Let F,GF(Δ). We say that F and G form a gap in Δ if FG= and the induced subcollection on the vertex set FG is exactly F,G. A matching M of Δ is called a restricted matching if there exists a facet in M that forms a gap with every other facet in M. The maximal size of a restricted matching of Δ is called the restricted matching number.

My question. In SageMath, is there any known algorithm to compute the restricted matching number of a simplicial complex, or at least of a graph (i.e., a 1-dimensional simplicial complex)?

click to hide/show revision 2
No.2 Revision

Restricted matchings in simplicial complexes or graphs

Let Δ be a simplicial complex. Let F,GF(Δ). We say that F and G form a gap in Δ if FG= and the induced subcollection on the vertex set FG is exactly F,G. A matching M of Δ is called a restricted matching if there exists a facet in M that forms a gap with every other facet in M. The maximal size of a restricted matching of Δ is called the restricted matching number.

My question. In SageMath, is there any known algorithm to compute the restricted matching number of a simplicial complex, or at least of a graph (i.e., a 1-dimensional simplicial complex)?