Mathematics – Combinatorics
Scientific paper
2005-09-16
Mathematics
Combinatorics
9 pages, 1 figure
Scientific paper
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.
Delucchi Emanuele
No associations
LandOfFree
Subdivision of complexes of k-Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Subdivision of complexes of k-Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subdivision of complexes of k-Trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-553318