Matching complexes of small grids

zbMATH Open1416.05214arXiv1812.11000MaRDI QIDQ2001978FDOQ2001978

Authors: Takahiro Matsushita 

Publication date: 11 July 2019

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

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.

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

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

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

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)