A classical result of Kleitman determines the maximum number of subsets in a family of sets that do not contain distinct sets that are pairwise disjoint in the case (mod ). Katona and Nagy determined the maximum size of a family of subsets of an -element set that does not contain with and being disjoint. In this paper, we consider the problem of finding the maximum number in a family without sets such that are pairwise disjoint. We determine the asymptotics of if (mod ) for all , and if (mod ), and show that in this latter case the asymptotics of the subcase is different from both the and subcases.

生成讲解博客的中文版本

生成AI智能校验的中文版本