Pratiksha Chauhan

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Homology of matching complexes of $3 \times n$ grid graphs

Pratiksha Chauhan, Anchal Sharma, Samir Shukla

For a finite simple graph $G$ , the matching complex $M (G)$ is the simplicial complex whose vertex set is the edge set of $G$ and whose simplices are all the matchings in $G$ . The t…

math.CO2026

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…

math.CO2025

Total $2$ -cut complexes of powers of cycle graphs and Cartesian products of certain graphs

Pratiksha Chauhan, Samir Shukla, Kumar Vinayak

For a positive integer $k$ , the \emph{ total $k$ -cut complex} of a graph $G$ , denoted as $Δ_{k}^{t} (G)$ , is the simplicial complex whose facets are $σ \subseteq V (G)$ such that $|σ| = |…

math.CO2024

Shellability of $3$ -Cut Complexes of Squared Cycle Graphs

Pratiksha Chauhan, Samir Shukla, Kumar Vinayak

For a positive integer $k$ , the $k$ -cut complex of a graph $G$ is the simplicial complex whose facets are the $(∣ V (G) ∣ - k)$ -subsets $σ$ of the vertex set $V (G)$ of $G$ such that the…

Homology of matching complexes of 3×n grid graphs

Shellability of 3-cut complexes of powers of cycle graphs

Total 2-cut complexes of powers of cycle graphs and Cartesian products of certain graphs

Shellability of 3-Cut Complexes of Squared Cycle Graphs

Homology of matching complexes of $3 \times n$ grid graphs

Total $2$ -cut complexes of powers of cycle graphs and Cartesian products of certain graphs

Shellability of $3$ -Cut Complexes of Squared Cycle Graphs