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

arXiv2102.07894MaRDI QIDQ6504367FDOQ6504367

Lukas Katthän, Joel Brewster Lewis, Darij Grinberg

Abstract: We study the homotopy type and other properties of two simplicial complexes arising from a directed graph $G=(V,E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $FsubseteqE$ that contain no path from $s$ to $t$, and the *path-missing complex*, its Alexander dual.

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial identities, bijective combinatorics (05A19) Flows in graphs (05C21) Combinatorial aspects of simplicial complexes (05E45)

This page was built for publication: The path-missing and path-free complexes of a directed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6504367)