Let Δ be a simplicial complex. Let F,G∈F(Δ). We say that F and G form a gap in Δ if F∩G=∅ and the induced subcollection on the vertex set F∪G 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)?