ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Matching complexes of 3 � n grid graphs

Goyal, S and Shukla, S and Singh, A (2021) Matching complexes of 3 � n grid graphs. In: Electronic Journal of Combinatorics, 28 (4).

[img]
Preview
PDF
ele_jou_com_28-04_2021.pdf - Published Version

Download (501kB) | Preview
Official URL: https://doi.org/10.37236/10496

Abstract

The matching complex of a graph G is a simplicial complex whose simplices are matchings in G. In the last few years the matching complexes of grid graphs have gained much attention among the topological combinatorists. In 2017, Braun and Hough obtained homological results related to the matching complexes of 2�n grid graphs. Further in 2019, Matsushita showed that the matching complexes of 2 � n grid graphs are homotopy equivalent to a wedge of spheres. In this article we prove that the matching complexes of 3 � n grid graphs are homotopy equivalent to a wedge of spheres. We also give the comprehensive list of the dimensions of spheres appearing in the wedge. © The authors. Released under the CC BY-ND license (International 4.0).

Item Type: Journal Article
Publication: Electronic Journal of Combinatorics
Publisher: Australian National University
Additional Information: The copyright for this article belongs to Authors
Department/Centre: Division of Physical & Mathematical Sciences > Mathematics
Date Deposited: 07 Dec 2021 10:25
Last Modified: 07 Dec 2021 10:25
URI: http://eprints.iisc.ac.in/id/eprint/70587

Actions (login required)

View Item View Item