arXiv Analytics

Sign in

arXiv:0803.3840 [math.CO]AbstractReferencesReviewsResources

Set families with a forbidden subposet

Boris Bukh

Published 2008-03-26, updated 2009-11-21Version 3

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.

Comments: 10 pages, 1 figure, motivation and details expanded, final version
Categories: math.CO
Subjects: 06A07, 05D05
Related articles: Most relevant | Search more
arXiv:math/0112067 [math.CO] (Published 2001-12-07)
A unifying generalization of Sperner's theorem
arXiv:1106.2315 [math.CO] (Published 2011-06-12)
Set families with a forbidden induced subposet
arXiv:1111.4636 [math.CO] (Published 2011-11-20, updated 2017-12-01)
A note on traces of set families

Links

Toolbox