English

The path-missing and path-free complexes of a directed graph

Combinatorics 2025-06-12 v3 Algebraic Topology

Abstract

We study two simplicial complexes arising from a directed graph G=(V,E)G = (V, E) with two chosen vertices ss and tt: the *path-free complex*, consisting of all subsets FEF \subseteq E that contain no path from ss to tt, and the *path-missing complex*, its Alexander dual. Using discrete Morse theory, we prove that both complexes have well-behaved homotopy types -- either contractible or homotopy-equivalent to spheres.

Keywords

Cite

@article{arxiv.2102.07894,
  title  = {The path-missing and path-free complexes of a directed graph},
  author = {Darij Grinberg and Lukas Katthän and Joel Brewster Lewis},
  journal= {arXiv preprint arXiv:2102.07894},
  year   = {2025}
}

Comments

49 pages (37 main, 10 appendix, 2 bib). New version has a few typos fixed, some clearer proofs and a new Figure 1. Comments welcome!

R2 v1 2026-06-23T23:11:38.430Z