Probably intersecting families are not nested

COMBINATORICS PROBABILITY & COMPUTING(2013)

引用 3|浏览0
暂无评分
摘要
It is well known that an intersecting family of subsets of an n-element set can contain at most 2n-1 sets. It is natural to wonder how 'close' to intersecting a family of size greater than 2n-1 can be. Katona, Katona and Katona introduced the idea of a 'most probably intersecting family'. Suppose that is a family and that 0 p p be the random family formed by selecting each set in independently with probability p. A family is most probably intersecting if it maximizes the probability that p is intersecting over all families of size ||. Katona, Katona and Katona conjectured that there is a nested sequence consisting of most probably intersecting families of every possible size. We show that this conjecture is false for every value of p provided that n is sufficiently large.
更多
查看译文
关键词
n-element set,random family,possible size,nested sequence,intersecting family,probability p
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要