Complexes of Directed Graphs

From MaRDI portal





A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in [Topology 38, No. 2, 271-299 (1999; Zbl 0936.57002)]) motivated by the theory of Vassiliev invariants in knot theory. In the paper under review complexes of directed graphs are studied. The main results are: Theorem 1.1. Let \(P\) mean the property of a digraph to be acyclic, i.e. to contain no direct cycles. Then the complex \(\Delta^P_n\) is homotopy equivalent to the \((n-2)\)-dimensional sphere. Theorem 1.2. Let \(P\) mean the property not to be strongly connected. The complex \(\Delta^P_n\) has the homotopy type of a wedge of \((n-1)!\) spheres of dimension \(2n-4\). Complexes of some other classes of digraphs (in particular, directed matchings) along with some remarks on the action of the symmetric group on the homology are also considered.











This page was built for publication: Complexes of Directed Graphs

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