相关论文: Families of Sets with Intersecting Clusters

A family $\{A_{0},\ldots,A_{d}\}$ of $k$-element subsets of $[n]=\{1,2,\ldots,n\}$ is called a simplex-cluster if $A_{0}\cap\cdots\cap A_{d}=\varnothing$, $|A_{0}\cup\cdots\cup A_{d}|\le2k$, and the intersection of any $d$ of the sets in…

A $d$-simplex is defined to be a collection $A_1,\dots,A_{d+1}$ of subsets of size $k$ of $[n]$ such that the intersection of all of them is empty, but the intersection of any $d$ of them is non-empty. Furthermore, a $d$-cluster is a…

For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…

If $2 \le d \le k$ and $n \ge dk/(d-1)$, a $d$-cluster is defined to be a collection of $d$ elements of ${[n] \choose k}$ with empty intersection and union of size no more than $2k$. Mubayi conjectured that the largest size of a…

Mubayi's Conjecture states that if $\mathcal{F}$ is a family of $k$-sized subsets of $[n] = \{1,\ldots,n\}$ which, for $k \geq d \geq 2$, satisfies $A_1 \cap\cdots\cap A_d \neq \emptyset$ whenever $|A_1 \cup\cdots\cup A_d| \leq 2k$ for all…

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

For an integer $d \geq 2$, a family $\mathcal{F}$ of sets is $\textit{$d$-wise intersecting}$ if for any distinct sets $A_1,A_2,\dots,A_d \in \mathcal{F}$, $A_1 \cap A_2 \cap \dots \cap A_d \neq \emptyset$, and $\textit{non-trivial}$ if…

Three $k$-dimensional subspaces $A$, $B$, and $C$ of an $n$-dimensional vector space $V$ over a finite field are called a $3$-cluster if $A \cap B \cap C = \{\mathbf{0}_V\}$ and yet $\dim(A+B+C) \leq 2k$. A special kind of $3$-cluster,…

For a positive integer $d\geq 2$, a family $\mathcal F\subseteq \binom{[n]}{k}$ is said to be d-wise intersecting if $|F_1\cap F_2\cap \dots\cap F_d|\geq 1$ for all $F_1, F_2, \dots ,F_d\in \mathcal F$. A d-wise intersecting family…

A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…

Let $n > k > 1$ be integers, $[n] = \{1, \ldots, n\}$. Let $\mathcal F$ be a family of $k$-subsets of~$[n]$. The family $\mathcal F$ is called intersecting if $F \cap F' \neq \emptyset$ for all $F, F' \in \mathcal F$. It is called almost…

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

A family of subsets of $[n]$ is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combinatorics. Frankl-Kupavskii and Balogh-Das-Liu-Sharifzadeh-Tran…

A family of sets is said to be \emph{intersecting} if any two sets in the family have nonempty intersection. In 1973, Erd\H{o}s raised the problem of determining the maximum possible size of a union of $r$ different intersecting families of…

A family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is called $k$-wise intersecting if any $k$ members of $\mathcal{F}$ have non-empty intersection, and it is called maximal $k$-wise intersecting if no family strictly containing…

A family $\mathcal F\subset 2^{[n]}$ is called intersecting if any two of its sets intersect. Given an intersecting family, its diversity is the number of sets not passing through the most popular element of the ground set. Peter Frankl…

We consider families of $k$-subsets of $\{1, \dots, n\}$, where $n$ is a multiple of $k$, which have no perfect matching. An equivalent condition for a family $\mathcal{F}$ to have no perfect matching is for there to be a blocking set,…

We say that a family of $k$-subsets of an $n$-element set is intersecting if any two of its sets intersect. In this paper we study properties and structure of large intersecting families. We prove a conclusive version of Frankl's theorem on…