Metraipolis › archive › dc_8a4a2ba658e6
The Homotopy Types of the Independence and Perfect Matching Complexes of Möbius and Circular Ladder Graphs — arXiv:2608.30601
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30601
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:31:14.163Z
- SHA-256 of the archived text
141adc26768ee3be99cb52ce7f45e164e10213e07f33bb8b9dc5165c63c9aa21- Stable URL of this page
https://metraipolis.com/documento/dc_8a4a2ba658e6
How to cite
The Homotopy Types of the Independence and Perfect Matching Complexes of Möbius and Circular Ladder Graphs — arXiv:2608.30601 — arXiv (en), https://arxiv.org/abs/2608.30601 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8a4a2ba658e6 (Metraipolis archive dc_8a4a2ba658e6, sha256 141adc26768ee3be99cb52ce7f45e164e10213e07f33bb8b9dc5165c63c9aa21)
BibTeX
@misc{dc8a4a2ba658e6,
title = {The Homotopy Types of the Independence and Perfect Matching Complexes of Möbius and Circular Ladder Graphs — arXiv:2608.30601},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30601},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8a4a2ba658e6; sha256 141adc26768ee3be99cb52ce7f45e164e10213e07f33bb8b9dc5165c63c9aa21},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30601. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The independence complex and perfect matching complex of a graph are simplicial complexes encoding, respectively, its independent sets and perfect matchings. Determining their homotopy types is generally difficult, with explicit descriptions known mainly for highly structured graph families. In this article, we determine the homotopy types of these complexes for the Möbius ladder graphs $M_{2n}$ and circular ladder graphs $\mathcal{C}_{2n}$. The Möbius ladder graphs $M_{2n}$ are highly symmetric cubic graphs obtained from a $2n$-cycle by joining opposite vertices, while the circular ladder graphs $\mathcal{C}_{2n}$ are the Cartesian products of an $n$-cycle and a path of length one. We show that $\operatorname{Ind}(M_{2n})$ and $\operatorname{Ind}(\mathcal{C}_{2n})$ have the homotopy type of wedges of spheres, with the numbers and dimensions of the spheres exhibiting periodic behavior according to $n$ modulo $4$. For the perfect matching complex $\mathcal{M}_p(M_{2n})$, its homotopy type is a wedge of two copies of $\mathbb{S}^{(n-2)/2}$ when $n$ is even, while for odd $n$ it has the homotopy type of a wedge of spheres whose numbers and dimensions depend periodically on $n$ modulo $6$. The perfect matching complex $\mathcal{M}_p(\mathcal{C}_{2n})$ is contractible for odd $n$, whereas for even $n$ its homotopy type is a wedge of spheres, with the numbers and dimensions determined periodically by $n$ modulo $6$. Thus, we obtain explicit homotopy types for the independence and perfect matching complexes of two highly symmetric families of cubic graphs, which are also relevant in crystallization theory and the combinatorial representation of PL manifolds.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.30601 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T09:02:28.863Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).