相关论文: Sperner's Theorem and a Problem of Erdos-Katona-Kl…
A central theorem in combinatorics is Sperner's Theorem, which determines the maximum size of a family $\mathcal{F}\subseteq \mathcal{P}(n)$ that does not contain a $2$-chain $F_1\subsetneq F_2$. Erd\H{o}s later extended this result and…
A well-known theorem of Sperner describes the largest collections of subsets of an $n$-element set none of which contains another set from the collection. Generalising this result, Erd\H{o}s characterised the largest families of subsets of…
A coloured version of classic extremal problems dates back to Erd\H{o}s and Rothschild, who in 1974 asked which $n$-vertex graph has the maximum number of 2-edge-colourings without monochromatic triangles. They conjectured that the answer…
We prove a "supersaturation-type" extension of both Sperner's Theorem (1928) and its generalization by Erdos (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family…
In this paper, we study the following classical question of extremal set theory: what is the maximum size of a family of subsets of $[n]$ such that no $s$ sets from the family are pairwise disjoint? This problem was first posed by Erd\H os…
Let $m(n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n) = {n\choose m+1}+\ldots +{n\choose 2m+1}$ if $n=3m+1$. Confirming the conjecture…
Let $\mathcal{F}$ be a family of subsets of $[n]$. The diameter of $\mathcal{F}$ is the maximum size of symmetric differences among pairs of its members. Resolving a conjecture of Erd\H{o}s, Kleitman determined the maximum size of a family…
Given a family $\mathcal{F}$ of subsets of $[n]$, we say two sets $A, B \in \mathcal{F}$ are comparable if $A \subset B$ or $B \subset A$. Sperner's celebrated theorem gives the size of the largest family without any comparable pairs. This…
The study of intersection problems on families of sets is one of the most important topics in extremal combinatorics. As we all know, the extremal problems involving certain intersection constraints are equivalent to that with the union…
Given integers $n\ge s\ge 2$, let $e(n,s)$ stand for the maximum size of a family of subsets of an $n$-element set that contains no $s$ pairwise disjoint members. The study of this quantity goes back to the 1960s, when Kleitman determined…
For integers $n\ge s\ge2$, let $e(n,s)$ denote the maximum size of a family $\F\subseteq2^{[n]}$ with no $s$ pairwise disjoint members. The problem of determining $e(n,s)$, now called the Erd\H{o}s--Kleitman problem, is the non-uniform…
Let $e(n,s)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $n$-element set that contains no $s$ pairwise disjoint members. In 1968, answering a question of Erd\H{o}s, Kleitman determined $e(sm-1,s)$ and $e(sm,s)$ for…
Chv\'{a}tal conjectured that a star is amongst the largest intersecting subfamiles of a finite subset-closed family of sets. Kleitman later strengthened Chv\'{a}tal's conjecture, suggesting that maximal intersecting subfamilies of $2^{[n]}$…
The two part Sperner theorem of Katona and Kleitman states that if $X$ is an $n$-element set with partition $X_1 \cup X_2$, and $\cF$ is a family of subsets of $X$ such that no two sets $A, B \in \cF$ satisfy $A \subset B$ (or $B \subset…
One of the most classical results in extremal set theory is Sperner's theorem, which says that the largest antichain in the Boolean lattice $2^{[n]}$ has size $\Theta\big(\frac{2^n}{\sqrt{n}}\big)$. Motivated by an old problem of Erd\H{o}s…
In this short note, we address two problems in extremal set theory regarding intersecting families. The first problem is a question posed by Kupavskii: is it true that given two disjoint cross-intersecting families $\mathcal{A}, \mathcal{B}…
Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdos-Ko-Rado from 1961 says that any such system has size at most ${n-1 \choose k-1}$. A natural question, which…
We find the (unique) largest subset of $\{0, 1, 2\}^n$ such that it contains no two elements, one of which is coordinatewise greater than the other, but strictly greater on at most $k$ coordinates. To do so, we decompose the cube into…
In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$-element set satisfying a condition. A condition is called chain-dependent, if it is satisfied for a family if and only if it is satisfied for…
The Erd\H os Matching Conjecture states that the maximum size $f(n,k,s)$ of a family $\mathcal{F}\subseteq \binom{[n]}{k}$ that does not contain $s$ pairwise disjoint sets is $\max\{|\mathcal{A}_{k,s}|,|\mathcal{B}_{n,k,s}|\}$, where…