相关论文: A note on uniform intersecting families with maxim…

Let $\mathcal{F}$ be a family of subsets of $[n]=\{1,\ldots,n\}$ and let $L$ be a set of nonnegative integers. The family $\mathcal{F}$ is \emph{$L$-intersecting} if $|F\cap F'|\in L$ for every two distinct members $F,F'\in\mathcal{F}$; and…

A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results…

The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the…

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz established by means of an example that there exists a maximal intersecting family of $k-$sets with approximately $(e-1)k!$ blocks. L\'{a}szl\'{o} Lov\'{a}sz conjectured that their example is…

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…

Let $r(k)$ denote the maximum number of edges in a $k$-uniform intersecting family with covering number $k$. Erd\H{o}s and Lov\'asz proved that $ \lfloor k! (e-1) \rfloor \leq r(k) \leq k^k.$ Frankl, Ota, and Tokushige improved the lower…

We consider the action of the $2$-dimensional projective special linear group $PSL(2,q)$ on the projective line $PG(1,q)$ over the finite field $\F_q$, where $q$ is an odd prime power. A subset $S$ of $PSL(2,q)$ is said to be an…

Two families $\mathcal A$ and $\mathcal B$ of $k$-subsets of an $n$-set are called cross-intersecting if $A\cap B\ne\emptyset$ for all $A\in \mathcal A, B\in \mathcal B $. Strengthening the classical Erd\H os-Ko-Rado theorem, Pyber proved…

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…

For $n > 2k \geq 4$ we consider intersecting families $\mathcal F$ consisting of $k$-subsets of $\{1, 2, \ldots, n\}$. Let $\mathcal I(\mathcal F)$ denote the family of all distinct intersections $F \cap F'$, $F \neq F'$ and $F, F'\in…

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…

A family $\mathcal{F}$ on ground set $[n]:=\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of at most $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while…

Let $k\ge d\ge 3$ be fixed. Let $\mathcal{F}$ be a $k$-uniform family on $[n]$. Then $\mathcal{F}$ is $(d,s)$-conditionally intersecting if it does not contain $d$ sets with union of size at most $s$ and empty intersection. Answering a…

We study the following natural arithmetic question regarding intersecting families: how large can a family of subsets of integers from $\{1, \ldots n\}$ be such that, for every pair of subsets in the family, the intersection contains a sum…

The celebrated Erd\H{o}s-Ko-Rado theorem determines the maximum size of a $k$-uniform intersecting family. The Hilton-Milner theorem determines the maximum size of a $k$-uniform intersecting family that is not a subfamily of the so-called…

Let $n=2k+1$ be odd with $k\geq3$. In this note, we give two intersecting families with diversity larger than $\sum_{i=k+1}^{2k} \binom {2k}{i}$, which disprove a conjecture of Huang.

We show that an $n$-uniform maximal intersecting family has size at most $e^{-n^{0.5+o(1)}}n^n$. This improves a recent bound by Frankl. The Spread Lemma of Alweiss, Lowett, Wu and Zhang plays an important role in the proof.

A family $\mathcal{F}$ on ground set $\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while maintaining this…

Let $U$ be a set of polynomials of degree at most $k$ over $\mathbb{F}_q$, the finite field of $q$ elements. Assume that $U$ is an intersecting family, that is, the graphs of any two of the polynomials in $U$ share a common point.…

For positive integers $w$ and $k$, two vectors $A$ and $B$ from $\mathbb{Z}^w$ are called $k$-crossing if there are two coordinates $i$ and $j$ such that $A[i]-B[i]\geq k$ and $B[j]-A[j]\geq k$. What is the maximum size of a family of…