Abstract
Let and let be the collection of all subsets of ordered by inclusion. is a {\em cutset} if it meets every maximal chain in , and the {\em width} of is the minimum number of chains in a chain decomposition of . Fix . What is the smallest value of such that there exists a cutset that consists only of subsets of sizes between and , and such that it contains exactly subsets of size for each ? The answer, which we denote by , gives a lower estimate for the width of a cutset between levels and in . After using the Kruskal-Katona Theorem to give a general characterization of cutsets in terms of the number and sizes of their elements, we find lower and upper bounds (as well as some exact values) for .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.