Supersaturation in the Boolean lattice
From MaRDI portal
Publication:5262057
zbMath1316.05119arXiv1303.4336MaRDI QIDQ5262057
Jean-Sébastien Sereni, Ross J. Kang, Andrew P. Dove, Jerrold R. Griggs
Publication date: 9 July 2015
Full work available at URL: https://arxiv.org/abs/1303.4336
Related Items (15)
Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ A generalization of the independence number ⋮ Supersaturation in posets and applications involving the container method ⋮ Structure and supersaturation for intersecting families ⋮ On some extremal and probabilistic questions for tree posets ⋮ Families in posets minimizing the number of comparable pairs ⋮ Solution to a problem of Katona on counting cliques of weighted graphs ⋮ The number of additive triples in subsets of abelian groups ⋮ Set Systems Containing Many Maximal Chains ⋮ Sperner's Theorem and a Problem of Erdős, Katona and Kleitman ⋮ Subsets of posets minimising the number of chains ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ On the number of monotone sequences ⋮ Comparable pairs in families of sets
This page was built for publication: Supersaturation in the Boolean lattice
