Set families with a forbidden subposet
Combinatorics
2009-11-21 v3
Abstract
We asymptotically determine the size of the largest family F of subsets of {1,...,n} not containing a given poset P if the Hasse diagram of P is a tree. This is a qualitative generalization of several known results including Sperner's theorem.
Keywords
Cite
@article{arxiv.0803.3840,
title = {Set families with a forbidden subposet},
author = {Boris Bukh},
journal= {arXiv preprint arXiv:0803.3840},
year = {2009}
}
Comments
10 pages, 1 figure, motivation and details expanded, final version