arXiv (OAI Expanded)
open access
The Homotopy Types of the Independence and Perfect Matching Complexes of Möbius and Circular Ladder Graphs
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Long Cycles in 2-Connected Tough Graphs#1000101
- Independent-[1, 2] sets of the subdivision graph, middle graph and R-graph of some families of graphs#329291
- Maxiumum packing of inside perfect 8-cycle systems#955675
- Koide Triangulation, the √(3/2) Scale, the √6 Full-State Norm, and an Inverse-Branch Geometric Construction#687436
- Ladders on Fano varieties#639161
Record · ID 1109141
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive