Matching complexes of small grids

MaRDI QIDQ2001978zbMATH OpenFDO

Authors Takahiro Matsushita

Publication date 11 July 2019

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

Full work available at URL https://arxiv.org/abs/1812.11000, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i3p1

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45)

Abstract: The matching complex $M(G)$ of a simple graph $G$ is the simplicial complex consisting of the matchings on $G$. The matching complex $M(G)$ is isomorphic to the independence complex of the line graph $L(G)$. Braun and Hough introduced a family of graphs $Delt{a}_n^m$, which is a generalization of the line graph of the $(nimes2)$-grid graph. In this paper, we show that the independence complex of $Delt{a}_n^m$ is a wedge of spheres. This gives an answer to a problem suggested by Braun and Hough.

Recommendations

• Matching and independence complexes related to small grids
• Matching complexes of \(3 \times n\) grid graphs
• Matching complexes of polygonal line tilings
• Complexes of graphs with bounded matching size
• Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs

Cites work

• Chessboard Complexes and Matching Complexes
• Combinatorial algebraic topology
• Complexes of directed trees
• Complexes of directed trees and independence complexes
• Matching and independence complexes related to small grids
• Optimal decision trees on simplicial complexes
• Simplicial complexes of graphs
• Splittings of independence complexes and the powers of cycles
• Torsion in the matching complex and chessboard complex

Cited in

(12)

• Matching complexes of \(3 \times n\) grid graphs
• Dominance complexes, neighborhood complexes and combinatorial Alexander duals
• The clique operator on matching and chessboard graphs
• General polygonal line tilings and their matching complexes
• Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs
• The facet ideals of matching complexes of line graphs
• Matching complexes of trees and applications of the matching tree algorithm
• MANIFOLD MATCHING COMPLEXES
• Perfect matching complexes of honeycomb graphs
• Matching and independence complexes related to small grids
• Combinatorial and topological aspects of path posets, and multipath cohomology
• Complexes of graphs with bounded matching size

This page was built for publication: Matching complexes of small grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001978)