English

On a generalization of a result of Kleitman

Combinatorics 2024-09-16 v1

Abstract

A classical result of Kleitman determines the maximum number f(n,s)f(n,s) of subsets in a family F2[n]\mathcal{F}\subseteq 2^{[n]} of sets that do not contain distinct sets F1,F2,,FsF_1,F_2,\dots,F_s that are pairwise disjoint in the case n0,1n\equiv 0,-1 (mod ss). Katona and Nagy determined the maximum size of a family of subsets of an nn-element set that does not contain A1,A2,,At,B1,B2,,BtA_1,A_2,\dots,A_t,B_1,B_2,\dots,B_t with i=1tAi\bigcup_{i=1}^t A_i and i=1tBi\bigcup_{i=1}^t B_i being disjoint. In this paper, we consider the problem of finding the maximum number vex(n,Ks×t)vex(n,K_{s\times t}) in a family F2[n]\mathcal{F}\subseteq 2^{[n]} without sets F11,,Ft1,,F1s,,FtsF^1_1,\dots,F^1_t,\dots,F^s_1,\dots,F^s_t such that Gj=i=1tFijG_j=\bigcup_{i=1}^tF^j_i j=1,2,,sj=1,2,\dots,s are pairwise disjoint. We determine the asymptotics of 2nvex(n,Ks×t)2^n-vex(n,K_{s\times t}) if n1n\equiv -1 (mod ss) for all tt, and if n0n\equiv 0 (mod ss), t3t\ge 3 and show that in this latter case the asymptotics of the t=2t=2 subcase is different from both the t=1t=1 and t3t\ge 3 subcases.

Keywords

Cite

@article{arxiv.2409.08694,
  title  = {On a generalization of a result of Kleitman},
  author = {Ryan R. Martin and Balázs Patkós},
  journal= {arXiv preprint arXiv:2409.08694},
  year   = {2024}
}