Saturating Sperner Families
Saturating Sperner Families
复制标题
斯佩纳家族饱和
DOI:
--
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
Balázs Patkós
中科院分区:
文献类型:
--
作者:
Dániel Gerbner;Balázs Keszegh;N. Lemons;C. Palmer;Dömötör Pálvölgyi;Balázs Patkós
A family $${mathcal{F} subseteq 2^{[n]}}$$ saturates the monotone decreasing property $${mathcal{P}}$$ if $${mathcal{F}}$$ satisfies $${mathcal{P}}$$ and one cannot add any set to $${mathcal{F}}$$ such that property $${mathcal{P}}$$ is still satisfied by the resulting family. We address the problem of finding the minimum size of a family saturating the k-Sperner property and the minimum size of a family that saturates the Sperner property and that consists only of l-sets and (l + 1)-sets.