2,665 research outputs found
-free families in the Boolean lattice
For a family of subsets of [n]=\{1, 2, ..., n} ordered by
inclusion, and a partially ordered set P, we say that is P-free
if it does not contain a subposet isomorphic to P. Let be the
largest size of a P-free family of subsets of [n]. Let be the poset with
distinct elements a, b, c, d, a<b, c<d; i.e., the 2-dimensional Boolean
lattice. We show that where . We also prove that the largest -free
family of subsets of [n] having at most three different sizes has at most
2.20711N members.Comment: 18 pages, 2 figure
Rainbow Ramsey problems for the Boolean lattice
We address the following rainbow Ramsey problem: For posets what is the
smallest number such that any coloring of the elements of the Boolean
lattice either admits a monochromatic copy of or a rainbow copy of
. We consider both weak and strong (non-induced and induced) versions of
this problem. We also investigate related problems on (partial) -colorings
of that do not admit rainbow antichains of size
An upper bound on the size of diamond-free families of sets
Let be the maximum size of a family of subsets of
not containing as a (weak) subposet. The diamond poset,
denoted , is defined on four elements with the relations
and . has been studied for many posets; one of the
major open problems is determining .
Studying the average number of sets from a family of subsets of on a
maximal chain in the Boolean lattice has been a fruitful method. We
use a partitioning of the maximal chains and introduce an induction method to
show that , improving on the earlier bound of
by Kramer,
Martin and Young.Comment: Accepted by JCTA. Writing is improved based on the suggestions of
referee
Generalizations of Sperner\u27s Theorem: Packing Posets, Families Forbidding Posets, and Supersaturation
Sperner\u27s Theorem is a well known theorem in extremal set theory that gives the size of the largest antichain in the poset that is the Boolean lattice. This is equivalent to finding the largest family of subsets of an -set, , such that the family is constructed from pairwise unrelated copies of the single element poset. For a poset , we are interested in maximizing the size of a family of subsets of , where each maximally connected component of is a copy of , and finding the extreme configurations that achieve this value. For instance, Sperner showed that when is one element, is the maximum number of copies of and that this is only achieved by taking subsets of a middle size. Griggs, Stahl, and Trotter have shown that when is a chain on elements, is asymptotically the maximum number of copies of . We find the extreme families for a packing of chains, answering a conjecture of Griggs, Stahl, and Trotter, as well as finding the extreme packings of certain other posets. For the general poset , we prove that the maximum number of unrelated copies of is asymptotic to a constant times . Moreover, the constant has the form , where is the size of the smallest convex closure over all embeddings of into the Boolean lattice. Sperner\u27s Theorem has been generalized by looking for , the size of a largest family of subsets of an -set that does not contain a general poset in the family. We look at this generalization, exploring different techniques for finding an upper bound on , where is the diamond. We also find all the families that achieve , the size of the largest family of subsets that do not contain either of the posets or . We also consider another generalization of Sperner\u27s theorem, supersaturation, where we find how many copies of are in a family of a fixed size larger than . We seek families of subsets of an -set of given size that contain the fewest -chains. Erd\H{o}s showed that a largest -chain-free family in the Boolean lattice is formed by taking all subsets of the middle sizes. Our result implies that by taking this family together with subsets of the -th middle size, we obtain a family with the minimum number of -chains, over all families of this size. We prove our result using the symmetric chain decomposition method of de Bruijn, van Ebbenhorst Tengbergen, and Kruyswijk (1951)
- …