English

Cross-Sperner families

Combinatorics 2011-04-21 v1

Abstract

A pair of families (\cF,\cG)(\cF,\cG) is said to be \emph{cross-Sperner} if there exists no pair of sets F\cF,G\cGF \in \cF, G \in \cG with FGF \subseteq G or GFG \subseteq F. There are two ways to measure the size of the pair (\cF,\cG)(\cF,\cG): with the sum \cF+\cG|\cF|+|\cG| or with the product \cF\cG|\cF|\cdot |\cG|. We show that if \cF,\cG2[n]\cF, \cG \subseteq 2^{[n]}, then \cF\cG22n4|\cF||\cG| \le 2^{2n-4} and \cF+\cG|\cF|+|\cG| is maximal if \cF\cF or \cG\cG consists of exactly one set of size n/2\lceil n/2 \rceil provided the size of the ground set nn is large enough and both \cF\cF and \cG\cG are non-empty.

Keywords

Cite

@article{arxiv.1104.3988,
  title  = {Cross-Sperner families},
  author = {Dániel Gerbner and Nathan Lemons and Cory Palmer and Balázs Patkós and Vajk Szécsi},
  journal= {arXiv preprint arXiv:1104.3988},
  year   = {2011}
}
R2 v1 2026-06-21T17:56:44.162Z