4.2 Article

The unbalance of set systems

期刊

GRAPHS AND COMBINATORICS
卷 24, 期 4, 页码 361-365

出版社

SPRINGER TOKYO
DOI: 10.1007/s00373-008-0793-9

关键词

intersecting set systems; intersecting families

向作者/读者索取更多资源

The unbalance of an intersecting family F is defined as |F| - d(F), where d(F) is the maximum degree of F i.e. the maximum of |{F epsilon F : x epsilon F}| over all vertices x. We show that the unbalance of a k-uniform intersecting family is at most [GRAPHICS] when n >= 6k(3) and we determine all families achieving this bound.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据