3 papers
math.CO2026
Topology of total cut complexes and cut complexes of grid graphs
Himanshu Chandrakar, Nisith Ranjan Hazra, Debotosh Rout +1
Inspired by the work of Fr{ö}berg (1990) and Eagon and Reiner (1998), Bayer et al. recently introduced two new graph complexes: total cut complexes and cut complexes. In this arti…
math.CO2025
Independence Complexes of Hexagonal Grid Graphs
Himanshu Chandrakar, Anurag Singh
The independence complex of a graph is a simplicial complex whose faces correspond to the independent sets of . While independence complexes have been studied extensively for ma…
math.CO2025
Perfect Matching Complexes of Polygonal Line Tilings
Himanshu Chandrakar, Anurag Singh
The perfect matching complex of a simple graph is a simplicial complex having facets (maximal faces) as the perfect matchings of . This article discusses the perfect matchin…