Matching complexes of \(3 \times n\) grid graphs

DOI10.37236/10496zbMath1482.05356arXiv2106.09915OpenAlexW3213418917MaRDI QIDQ2665955

Shuchita Goyal, Samir Shukla, Anurag Singh

Publication date: 22 November 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.09915

zbMATH Keywords

matching complexgrid graph

Mathematics Subject Classification ID

Classification of homotopy type (55P15) Combinatorial aspects of simplicial complexes (05E45)

Related Items (3)

Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs ⋮ Perfect matching complexes of honeycomb graphs ⋮ Higher matching complexes of complete graphs and complete bipartite graphs

Cites Work

• Unnamed Item
• Homology of certain sets of 2-subgroups of symmetric groups
• Complexes of directed trees
• Matching complexes of small grids
• Matching and independence complexes related to small grids
• Independence complexes of claw-free graphs
• Topology of matching, chessboard, and general bounded degree graph complexes
• Combinatorial algebraic topology

This page was built for publication: Matching complexes of \(3 \times n\) grid graphs