Complexes of directed trees of complete multipartite graphs
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})\).
- Complexes of directed trees and independence complexes
- Directed subgraph complexes
- Complexes of directed trees
- Graphs and balanced simplicial complexes
- Counting shellings of complete bipartite graphs and trees
- Multicyclic treelike reflexive graphs
- Complexes of Directed Graphs
- Shellability of complexes of directed trees
- Root polytopes and Jaeger‐type dissections for directed graphs
- On the homotopy type of multipath complexes
This page was built for publication: Complexes of directed trees of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853285)
