English

Multipath complexes of bidirectional polygonal digraphs

Combinatorics 2026-01-12 v1

Abstract

In this work we study the homotopy type of multipath complexes of bidirectional path graphs and polygons, motivated by works of Vre\'cica and \v{Z}ivaljevi\'c on cycle-free chessboard complexes (that is, multipath complexes of complete digraphs). In particular, we show that bidirectional path graphs are homotopic to spheres and that, in analogy with cycle-free chessboard complexes, multipath complexes of bidirectional polygonal digraphs are highly connected. Using a Mayer-Vietoris spectral sequence, we provide a computation of the associated homology groups. We study T-operations on graphs, and show that this corresponds to taking suspensions of multipath complexes. We further discuss (non) shellability properties of such complexes, and present new open questions.

Keywords

Cite

@article{arxiv.2601.05670,
  title  = {Multipath complexes of bidirectional polygonal digraphs},
  author = {Luigi Caputi and Carlo Collari and Jason P. Smith},
  journal= {arXiv preprint arXiv:2601.05670},
  year   = {2026}
}

Comments

11 pages, 7 fugures. Comments are welcome!

R2 v1 2026-07-01T08:57:33.777Z