Intersecting $P$-free families
Abstract
We study the problem of determining the size of the largest intersecting -free family for a given partially ordered set (poset) . In particular, we find the exact size of the largest intersecting -free family where is the butterfly poset and classify the cases of equality. The proof uses a new generalization of the partition method of Griggs, Li and Lu. We also prove generalizations of two well-known inequalities of Bollob\'{a}s and Greene, Katona and Kleitman in this case. Furthermore, we obtain a general bound on the size of the largest intersecting -free family, which is sharp for an infinite class of posets originally considered by Burcsi and Nagy, when is odd. Finally, we give a new proof of the bound on the maximum size of an intersecting -Sperner family and determine the cases of equality.
Keywords
Cite
@article{arxiv.1506.00864,
title = {Intersecting $P$-free families},
author = {Dániel Gerbner and Abhishek Methuku and Casey Tompkins},
journal= {arXiv preprint arXiv:1506.00864},
year = {2017}
}
Comments
Improved the writing following the suggestions of referees. Published version available via http://www.sciencedirect.com/science/article/pii/S009731651730047X