English
Related papers

Related papers: Extremal $t$-intersecting families for direct prod…

200 papers

For a family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$, let $\mathcal{D}(\mathcal{F}) = \{F\setminus G: F, G \in \mathcal{F}\}$ be the collection of all (setwise) differences of $\mathcal{F}$. The family $\mathcal{F}$ is called a…

Combinatorics · Mathematics 2022-11-09 Jagannath Bhanja , Sayan Goswami

Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial cross $t$-intersecting if $|F\cap G|\geq t$ for all $F\in \mathcal{F}, G\in \mathcal{G}$ and $|\cap \{F\colon F\in \mathcal{F}\}|<t$, $|\cap…

Combinatorics · Mathematics 2022-11-16 Peter Frankl , Jian Wang

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$, and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. The families $\mathcal{F}_1\subseteq{V\brack k_1},\mathcal{F}_2\subseteq{V\brack…

Combinatorics · Mathematics 2022-01-19 Mengyu Cao , Mei Lu , Benjian Lv , Kaishun Wang

A family $\mathcal{F}$ is $t$-$\it{intersecting}$ if any two members have at least $t$ common elements. Erd\H os, Ko, and Rado proved that the maximum size of a $t$-intersecting family of subsets of size $k$ is equal to $ {{n-t} \choose…

Combinatorics · Mathematics 2014-11-19 Dong Yeap Kang , Jaehoon Kim , Younjin Kim

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…

Combinatorics · Mathematics 2013-12-12 Peter Borg

Let $V$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$. In this paper we describe the structure of maximal non-trivial $t$-intersecting families of $k$-dimensional subspaces of $V$ with large size. We also determine…

Combinatorics · Mathematics 2020-07-24 Mengyu Cao , Benjian Lv , Kaishun Wang , Sanming Zhou

We study $t$-intersecting and $t$-cross-intersecting families of $k$-dimensional subspaces in finite vector spaces of dimension $n$. We show that all large $t$-intersecting families admit a governing low-dimensional structure for $n \ge…

Combinatorics · Mathematics 2026-05-05 Ferdinand Ihringer , Andrey Kupavskii

Let $V$ be a finite dimensional vector space over a finite field, and $\mathcal{F}$ a family consisting of $k$-subspaces of $V$. The family $\mathcal{F}$ is called $t$-intersecting if $\dim(F_{1}\cap F_{2})\geq t$ for any $F_{1}, F_{2}\in…

Combinatorics · Mathematics 2024-12-18 Lijun Ji , Dehai Liu , Kaishun Wang , Tian Yao , Shuhui Yu

Let $\mathcal{A}\subseteq{[n]\choose a}$ and $\mathcal{B}\subseteq{[n]\choose b}$ be two families of subsets of $[n]$, we say $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting if $A\cap B\neq \emptyset$ for all $A\in\mathcal{A}$,…

Combinatorics · Mathematics 2019-07-30 Xiangliang Kong , Yuanxiao Xi , Gennian Ge

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are called cross-intersecting if each pair of sets $A\in \mathcal{A}$ and $B\in \mathcal{B}$ has nonempty intersection. Let $\cal{A}$ and ${\cal B}$ be two cross-intersecting families of…

Combinatorics · Mathematics 2024-11-26 Biao Wu , Huajun Zhang

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…

Combinatorics · Mathematics 2019-03-06 Rogers Mathew , Ritabrata Ray , Shashank Srivastava

Let $V$ be an $(n+\ell)$-dimensional vector space over a finite field, and $W$ a fixed $\ell$-dimensional subspace of $V$. Write ${V\brack n,0}$ to be the set of all $n$-dimensional subspaces $U$ of $V$ satisfying $\dim(U\cap W)=0$. A…

Combinatorics · Mathematics 2021-03-23 Mengyu Cao , Benjian Lv , Kaishun Wang

A set of permutations of $\{1,2,\dots,n\}$ is $t$-intersecting if any two permutations agree on at least $t$ inputs. A recent work by Kupavskii, in the spirit of the Erd\H{o}s-Ko-Rado Theorem, shows that for all $t\leq…

Combinatorics · Mathematics 2026-05-26 Pitchayut Saengrungkongka

A family X of sets is said to be intersecting if any two members of X have non-empty intersection. It is a well-known and simple fact that an intersecting family of subsets of [n]={1,2,...,n} can contain at most 2^(n-1) sets. Katona, Katona…

Combinatorics · Mathematics 2011-08-17 Paul A. Russell

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F} _{q} $, and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. The families $\mathcal{F},\mathcal{G}\subseteq {V\brack k}$ are said to be…

Combinatorics · Mathematics 2026-02-13 Dehai Liu , Jinhua Wang , Tian Yao

Katona's intersection theorem states that every intersecting family $\mathcal F\subseteq[n]^{(k)}$ satisfies $\vert\partial\mathcal F\vert\geq\vert\mathcal F\vert$, where $\partial\mathcal F=\{F\setminus x:x\in F\in\mathcal F\}$ is the…

Combinatorics · Mathematics 2022-06-10 Marcelo Sales , Bjarne Schülke

Let $n$, $r$, $k_1,\ldots,k_r$ and $t$ be positive integers with $r\geq 2$, and $\mathcal{F}_i\ (1\leq i\leq r)$ a family of $k_i$-subsets of an $n$-set $V$. The families $\mathcal{F}_1,\ \mathcal{F}_2,\ldots,\mathcal{F}_r$ are said to be…

Combinatorics · Mathematics 2022-05-24 Mengyu Cao , Mei Lu , Benjian Lv , Kaishun Wang

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

Combinatorics · Mathematics 2016-05-30 Peter Borg

Let $\mathscr{P}$ be a symplectic polar space over a finite field $\mathbb{F}_q$, and $\mathscr{P}_m$ denote the set of all $m$-dimensional subspaces in $\mathscr{P}$. We say a $t$-intersecting subfamily of $\mathscr{P}_m$ is trivial if…

Combinatorics · Mathematics 2020-10-13 Tian Yao , Benjian Lv , Kaishun Wang

Two families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$ are called cross-$t$-intersecting if $|A\cap B|\geq t$ for all $A\in\mathcal A$, $B\in\mathcal B$. Let $n$, $k$ and $\ell$ be positive integers such…

Combinatorics · Mathematics 2025-03-21 Yanhong Chen , Anshui Li , Biao Wu , Huajun Zhang