Abstract
A family of sets is {\it -intersecting} if the cardinality of the intersection of every pair of sets in is at least , and is an {\it -family} if every set in has cardinality . A well-known theorem of Erdős, Ko, and Rado bounds the cardinality of a -intersecting -family of subsets of an -element set, or equivalently of -dimensional faces of a simplex with vertices. As a generalization of the Erdős-Ko-Rado theorem, Borg presented a conjecture concerning the size of a -intersecting -family of faces of an arbitrary simplicial complex. He proved his conjecture for shifted complexes. In this paper we give a new proof for this result based on work of Woodroofe. Using algebraic shifting we verify Borg's conjecture in the case of sequentially Cohen-Macaulay -near-cones 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.