相关论文: Families of Sets with Intersecting Clusters

The seminal Erd\H{o}s--Ko--Rado (EKR) theorem states that if $\mathcal{F}$ is a family of $k$-subsets of an $n$-element set $X$ for $k\leq n/2$ such that every pair of subsets in $\mathcal{F}$ has a nonempty intersection, then $\mathcal{F}$…

A $k$-partition of an $n$-set $X$ is a collection of $k$ pairwise disjoint non-empty subsets whose union is $X$. A family of $k$-partitions of $X$ is called $t$-intersecting if any two of its members share at least $t$ blocks. A…

Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$.For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$,let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$ are…

Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\{1,...,m\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting…

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be \emph{cross-$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects…

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

Let F be a family of subsets of an n-element set not containing four distinct members such that A union B is contained in C intersect D. It is proved that the maximum size of F under this condition is equal to the sum of the two largest…

Let $\mathcal{S}_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. A family $\mathcal{F}\subset \mathcal{S}_n$ is called intersecting if for every $\sigma,\pi\in \mathcal{F}$ there exists some $i\in [n]$ such that…

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}…

A family of sets is intersecting if every pair of its members has an element in common. Such a family of sets is called a star if some element is in every set of the family. Given a graph $G$, let $\mu(G)$ denote the size of the smallest…

We consider families of k-subsets of the standard n-set. Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all…

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

Let $m\geq 2$, $n$ be positive integers, and $R_i=\{k_{i,1} >k_{i,2} >\cdots> k_{i,t_i}\}$ be subsets of $[n]$ for $i=1,2,\ldots,m$. The families $\mathcal{F}_1\subseteq \binom{[n]}{R_1},\mathcal{F}_2\subseteq…

We consider the following generalization of the seminal Erd\H{o}s-Ko-Rado theorem, due to Frankl. For k>= 2, let F be a k-wise intersecting family of r-subsets of an n element set X, i.e. any k sets in F have a nonempty intersection. If r<=…

A set of permutations $I \subset S_n$ is said to be {\em k-intersecting} if any two permutations in $I$ agree on at least $k$ points. We show that for any $k \in \mathbb{N}$, if $n$ is sufficiently large depending on $k$, then the largest…

Let $\mathcal{F}\subseteq{[n]\choose k}$ be a $t$-intersecting family. Define the $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ as the minimum size of a subset $S$ of $[n]$ with $|S\cap F|\geqslant t$ for each…

The families $\mathcal F_1\subseteq \binom{[n]}{k_1},\mathcal F_2\subseteq \binom{[n]}{k_2},\dots,\mathcal F_r\subseteq \binom{[n]}{k_r}$ are said to be cross-intersecting if $|F_i\cap F_j|\geq 1$ for any $1\leq i<j\leq r$ and $F_i\in…

Let $\mathcal{A}=\{A_{1},...,A_{p}\}$ and $\mathcal{B}=\{B_{1},...,B_{q}\}$ be two families of subsets of $[n]$ such that for every $i\in [p]$ and $j\in [q]$, $|A_{i}\cap B_{j}|= \frac{c}{d}|B_{j}|$, where $\frac{c}{d}\in [0,1]$ is an…

We show that there is some absolute constant $c>0$, such that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}$, if \mbox{$|\mathcal{F}| \geq (\frac{1}{2}-c)2^n$}, then there is some element $i \in [n]$ that appears in at least…

The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. FC-families are families for which it is proved that every…