On a generalization of a result of Kleitman
Abstract
A classical result of Kleitman determines the maximum number f(n,s) of subsets in a family F⊂eq 2[n] of sets that do not contain distinct sets F1,F2,…,Fs that are pairwise disjoint in the case n 0,-1 (mod s). Katona and Nagy determined the maximum size of a family of subsets of an n-element set that does not contain A1,A2,…,At,B1,B2,…,Bt with i=1t Ai and i=1t Bi being disjoint. In this paper, we consider the problem of finding the maximum number vex(n,Ks× t) in a family F⊂eq 2[n] without sets F11,…,F1t,…,Fs1,…,Fst such that Gj=i=1tFji j=1,2,…,s are pairwise disjoint. We determine the asymptotics of 2n-vex(n,Ks× t) if n -1 (mod s) for all t, and if n 0 (mod s), t 3 and show that in this latter case the asymptotics of the t=2 subcase is different from both the t=1 and t 3 subcases.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.