6 papers
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…
Shellability of 3-cut complexes of powers of cycle graphs
Pratiksha Chauhan, Samir Shukla
In connection with commutative algebra, Bayer et al. introduced cut complexes in [Topology of cut complexes of graphs, SIAM J.\ Discrete Math., 38(2):1630-1675, 2024]. For a positi…
Total -cut complexes of powers of cycle graphs and Cartesian products of certain graphs
Pratiksha Chauhan, Samir Shukla, Kumar Vinayak
For a positive integer , the \emph{ total -cut complex} of a graph , denoted as , is the simplicial complex whose facets are such that $|Ï|…
Matching complexes of grid graphs
Shuchita Goyal, Samir Shukla, Anurag Singh
The matching complex of a graph is a simplicial complex whose simplices are matchings in . In the last few years the matching complexes of grid graphs have gained much atten…
On the Vietoris-Rips Complexes of Integer Lattices
Raju Kumar Gupta, Sourav Sarkar, Samir Shukla
For a metric space and , the Vietoris-Rips complex is a simplicial complex whose simplices are finite subsets of with diameter at most . Vi…
Shellability of -Cut Complexes of Squared Cycle Graphs
Pratiksha Chauhan, Samir Shukla, Kumar Vinayak
For a positive integer , the -cut complex of a graph is the simplicial complex whose facets are the -subsets of the vertex set of such that th…