2 papers
math.CO2026
On the matching complexes of categorical product of path graphs
Raju Kumar Gupta, Sourav Sarkar, Sagar S. Sawant +1
The matching complex of a graph is a simplicial complex whose simplices are matchings in . These complexes appear in various places and found applications in…
math.CO2024
On distinguishing digraphs by its quasisymmetric B-polynomial
N. Narayanan, Sagar S. Sawant
The -polynomial defined by J. Awan and O. Bernardi is a generalization of Tutte Polynomial to digraphs. In this paper, we solve an open question raised by J. Awan and O. Bernard…