Non-trivial r-wise agreeing families
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IRFWHQKTrecord.jsonopen to challenge →
classification
math.CO
keywords
agreeingfamilywisecontainedfamiliesnon-trivialsetsbrace-daykin
read the original abstract
A family of subsets of $[n]$ is $r$-wise agreeing if for any $r$ sets from the family there is an element $x$ that is either contained in all or contained in none of the $r$ sets. The study of such families is motivated by questions in discrete optimization. In this paper, we determine the size of the largest non-trivial $r$-wise agreeing family. This can be seen as a generalization of the classical Brace-Daykin theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.