28 research outputs found
On an extremal problem for poset dimension
Let be the largest integer such that every poset on elements has a
-dimensional subposet on elements. What is the asymptotics of ?
It is easy to see that . We improve the best known upper
bound and show . For higher dimensions, we show
, where is the largest
integer such that every poset on elements has a -dimensional subposet on
elements.Comment: removed proof of Theorem 3 duplicating previous work; fixed typos and
reference
Forbidden subposet problems in the grid
For posets and , extremal and saturation problems about weak and
strong -free subposets of have been studied mostly in the case is
the Boolean poset , the poset of all subsets of an -element set ordered
by inclusion. In this paper, we study some instances of the problem with
being the grid, and its connections to the Boolean case and to the forbidden
submatrix problem
An improvement of the general bound on the largest family of subsets avoiding a subposet
Let be the maximum size of a family of subsets of not containing as a (weak) subposet, and let be the length of
a longest chain in . The best known upper bound for in terms of
and is due to Chen and Li, who showed that for any fixed .
In this paper we show that for any fixed , improving the best known upper bound. By choosing appropriately, we
obtain that as a corollary, which we show is best
possible for general . We also give a different proof of this corollary by
using bounds for generalized diamonds. We also show that the Lubell function of
a family of subsets of not containing as an induced subposet is
for every .Comment: Corrected mistakes, improved the writing. Also added a result about
the Lubell function with forbidden induced subposets. The final publication
will be available at Springer via http://dx.doi.org/10.1007/s11083-016-9390-
Induced and non-induced forbidden subposet problems
The problem of determining the maximum size that a -free
subposet of the Boolean lattice can have, attracted the attention of many
researchers, but little is known about the induced version of these problems.
In this paper we determine the asymptotic behavior of , the maximum
size that an induced -free subposet of the Boolean lattice can have
for the case when is the complete two-level poset or the complete
multi-level poset when all 's either equal 4 or
are large enough and satisfy an extra condition. We also show lower and upper
bounds for the non-induced problem in the case when is the complete
three-level poset . These bounds determine the asymptotics of
for some values of independently of the values of and
Supersaturation and stability for forbidden subposet problems
We address a supersaturation problem in the context of forbidden subposets. A
family of sets is said to contain the poset if there is an
injection such that implies . The poset on four elements with is
called butterfly. The maximum size of a family
that does not contain a butterfly is as proved by De Bonis, Katona, and
Swanepoel. We prove that if contains
sets, then it has to contain at least copies of the butterfly provided for some positive . We show by a
construction that this is asymptotically tight and for small values of we
show that the minimum number of butterflies contained in is
exactly