Subdivision of complexes of k-Trees
Combinatorics
2007-05-23 v1
Abstract
Consider the poset of partitions of {1,...(n-1)k+1} with block sizes congruent to 1 modulo k. We prove that its order complex is a subdivision of the complex of k-trees, thereby answering a question posed by Feichtner. The result is obtained by an ad-hoc generalization of concepts from the theory of nested set complexes to non-lattices.
Cite
@article{arxiv.math/0509378,
title = {Subdivision of complexes of k-Trees},
author = {Emanuele Delucchi},
journal= {arXiv preprint arXiv:math/0509378},
year = {2007}
}
Comments
9 pages, 1 figure