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

MaRDI QIDQ6504367arXivFDO

Authors Darij Grinberg, Lukas Katthän, Joel Brewster Lewis

Published in arXiv

Mathematics Subject Classification ID

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

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.

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)