AbstractA short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (nk) over the n-set is at least (no) +⋯+(nk) for 0⩽k⩽12n. An equally short proof of Harper's isoperimetric theorem is provided as well
AbstractLet X be an n-element set and F ⊂ (kx) such that all the (2 |F|) sets F1 ⌣ F2, F1, F2 ∈ F ar...
AbstractA multiset M is a finite set consisting of several different kinds of elements, and an antic...
AbstractConsider the poset Pn of partitions of an n-element set ordered by refinement. Let S(n, k) b...
AbstractA short proof of the following result of Kleitman is given: the total number of sets contain...
For given positive integers $k$ and $n$, a family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is $k$...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
Let n ⩾4 be a natural number, and let K be a set K⊆[n]:={1,2,...,n}. We study the problem of finding...
AbstractLet M be a finite set consisting of ki elements of type i, i = 1, 2,…, n and let S denote th...
Let n> 4 be a natural number, and let K be a set K ⊆ [n]: = {1, 2,..., n}. We study the problem t...
AbstractLet X be an n-element set and F ⊂ (kx) such that all the (2 |F|) sets F1 ⌣ F2, F1, F2 ∈ F ar...
AbstractA multiset M is a finite set consisting of several different kinds of elements, and an antic...
AbstractConsider the poset Pn of partitions of an n-element set ordered by refinement. Let S(n, k) b...
AbstractA short proof of the following result of Kleitman is given: the total number of sets contain...
For given positive integers $k$ and $n$, a family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is $k$...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
In this thesis, we present a number of results, mostly concerning set systems that are antichains an...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
Let n ⩾4 be a natural number, and let K be a set K⊆[n]:={1,2,...,n}. We study the problem of finding...
AbstractLet M be a finite set consisting of ki elements of type i, i = 1, 2,…, n and let S denote th...
Let n> 4 be a natural number, and let K be a set K ⊆ [n]: = {1, 2,..., n}. We study the problem t...
AbstractLet X be an n-element set and F ⊂ (kx) such that all the (2 |F|) sets F1 ⌣ F2, F1, F2 ∈ F ar...
AbstractA multiset M is a finite set consisting of several different kinds of elements, and an antic...
AbstractConsider the poset Pn of partitions of an n-element set ordered by refinement. Let S(n, k) b...
DOI
Add to ORKG