Papers › On the homotopy type of multipath complexes
On the homotopy type of multipath complexes
Luigi Caputi, Carlo Collari, Sabino Di Trani, Jason P. Smith
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph G is the simplicial complex whose faces are the multipaths of G. We compute the Euler characteristic, and associated generating function, of the multipath complex for some families of graphs, including transitive tournaments and complete bipartite graphs. Then, we compute the homotopy type of multipath complexes of linear graphs, polygons, small grids and transitive tournaments. We show that they are all contractible or wedges of spheres. We introduce a new technique for decomposing directed graphs into dynamical regions, which allows us to simplify the homotopy computations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections