Complexes of directed trees of complete multipartite graphs (Q2853285)

To any directed graph \(D\) one could associate a simplicial complex \(\Delta(D)\) whose vertices are oriented edges of \(D\) and the faces are all directed forests that are subgraphs of \(D\). R. Stanley posed the question of shellability of this complex, and D. Kozlov showed that the answer is in the affirmative when \(D\) contains a complete source.NEWLINENEWLINE In this paper, the result is extended to the class of directed graphs having a dominant pair of vertices. As an important special case, the author considers the multipartite graphs \(K_{n_1,\dots,n_k}\) and the associated directed graph \(\overrightarrow{K}_{n_1,\dots,n_k}\) where each edge of \(K_{n_1,\dots,n_k}\) is replaced by a pair of directed edges going in opposite directions. The obtained shelling order of the complex \(\Delta(\overrightarrow{K}_{n_1,\dots,n_k})\) enables him to determine the homotopy type of this complex, and the \(h\)-vector of \(\Delta(\overrightarrow{K}_{m,n})\).