Paperlane

no. 15 · Monday 16 November 2026

Perfect Matching Complexes of $3\times 2n$ Grid Graph

Himanshu Chandrakar, Trung Chau, Shuchita Goyal, Rahul Karki and B. Subhash

math.CO · 9 pp

Abstract

The perfect matching complex of a simple graph $G$ is an abstract simplicial complex whose facets (maximal faces) are precisely the perfect matchings of $G$. In this article, we study the topology of the perfect matching complex of the $3\times 2n$ grid graph and show that it is homotopy equivalent to a wedge of $f_{n-1}$ copies of $(n-1)$-dimensional spheres, where $f_{k}$ denotes the $k$-th Fibonacci number. This proves a particular case of the conjecture given by Chandrakar and Singh for perfect matching complex of grid graphs.

comments
9 pages, 1 figure, Comments are welcome!
fields
Combinatorics, Algebraic Topology
pdf ↗ page arXiv:2611.18058 ↗