{"paper":{"title":"Matching complexes of small grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Takahiro Matsushita","submitted_at":"2018-12-28T14:21:37Z","abstract_excerpt":"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)$.\n  Braun and Hough introduced a family of graphs $\\Delta^m_n$, which is a generalization of the line graph of the $(n \\times 2)$-grid graph. In this paper, we show that the independence complex of $\\Delta^m_n$ is a wedge of spheres. This gives an answer to a problem suggested by Braun and Hough."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11000","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}