Related papers: $s$-almost cross-$t$-intersecting families for vec…

Guo and Xu determined the maximum size of intersecting families over finite affine spaces and showed that any family reaches maximum size must be trivial. In this paper, we characterize non-trivial intersecting family with maximum size.

We say that a family of $k$-subsets of an $n$-element set is {\it intersecting}, if any two of its sets intersect. In this paper, we study the structure of large intersecting families. Several years ago, Han and Kohayakawa (Proc. AMS,…

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…

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…

Let $\mathbb N_0$ be the set of non-negative integers, and let $P(n,l)$ denote the set of all weak compositions of $n$ with $l$ parts, i.e., $P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\mathbb N_0^l\ :\ x_1+x_2+\cdots+x_l=n\}$. For any element…

A pair of families $(\cF,\cG)$ is said to be \emph{cross-Sperner} if there exists no pair of sets $F \in \cF, G \in \cG$ with $F \subseteq G$ or $G \subseteq F$. There are two ways to measure the size of the pair $(\cF,\cG)$: with the sum…

A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…

For a family of sets $\mathcal{F}$, let $\omega(\mathcal{F}):=\sum_{\{A,B\}\subset \mathcal{F}}|A\cap B|$. In this paper, we prove that provided $n$ is sufficiently large, for any $\mathcal{F}\subset \binom{[n]}{k}$ with $|\mathcal{F}|=m$,…

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$, and let $\mathcal{L}(V)=\bigcup_{0\leq k\leq n}\left[V\atop k\right]$ be the set of all subspaces of $V$. A family of subspaces $\mathcal{F}\subseteq…

A stable set in a graph G is a set of mutually non-adjacent vertices, alpha(G) is the size of a maximum stable set of G, and core(G) is the intersection of all its maximum stable sets. In this paper we demonstrate that in a tree T, of order…

Two elements $g$ and $h$ of a permutation group $G$ acting on a set $V$ are said to be intersecting if $g(v) = h(v)$ for some $v \in V$. More generally, a subset ${\cal F}$ of $G$ is an intersecting set if every pair of elements of ${\cal…

Let $G$ be a finite group and recall that the Frattini subgroup ${\rm Frat}(G)$ is the intersection of all the maximal subgroups of $G$. In this paper, we investigate the intersection number of $G$, denoted $\alpha(G)$, which is the minimal…

Define an embedding of graph $G=(V,E)$ with $V$ a finite set of distinct points on the unit circle and $E$ the set of line segments connecting the points. Let $V_1,\ldots,V_k$ be a labeled partition of $V$ into equal parts. A 2-factor is…

A family $\mathcal C$ of sets is hereditary if whenever $A\in \mathcal C$ and $B\subset A$, we have $B\in \mathcal C$. Chv\'atal conjectured that the largest intersecting subfamily of a hereditary family is the family of all sets containing…

A $k\ell$-subset partition, or $(k,\ell)$-subpartition, is a $k\ell$-subset of an $n$-set that is partitioned into $\ell$ distinct classes, each of size $k$. Two $(k,\ell)$-subpartitions are said to $t$-intersect if they have at least $t$…

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…

We construct a left-compressed family F(n, k, G) generated by a collection of generating sets G, and identify conditions on G under which F(n, k, G) is an intersecting family. From this, we obtain a convenient method to construct…

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…

A family of sets is said to be intersecting if every pair of sets in the family have non-empty intersection. In this paper, we initiate the study of intersecting non-uniform families of sets of one of two sizes containing given subfamilies.…

Let $ n\geqslant t\geqslant 1$ and $ \mathcal{A}_1, \mathcal{A}_2, \ldots, \mathcal{A}_m \subseteq 2^{[n]}$ be non-empty families. We say that they are pairwise cross $t$-intersecting if $|A_i\cap A_j|\geqslant t$ holds for any $A_i\in…