On a generalization of a result of Kleitman
Combinatorics
2024-09-16 v1
Abstract
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.
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}
}