Tian Yao

activity

20202026

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

On Erdős--Ko--Rado and Hilton--Milner Theorems for Direct Products

Tian Yao, Mengyu Cao, Kaishun Wang

We investigate $t$ -intersecting families in direct-product set systems obtained by prescribing the number of selected elements in each part of a partitioned ground set. For a finit…

math.CO2026

Non-trivial cross- $t$ -intersecting families for vector spaces with the maximum sum of sizes

Dehai Liu, Kaishun Wang, Tian Yao

Let $V$ be an $n$ -dimensional vector space over a finite field. Suppose that $F$ and $G$ are non-empty families of $k$ -subspaces and $ℓ$ -subspaces of $V$ , re…

math.CO2026

$s$ -almost cross- $t$ -intersecting families for vector spaces

Dehai Liu, Jinhua Wang, Tian Yao

Let $V$ be an $n$ -dimensional vector space over the finite field $F_{q}$ , and $[k V]$ denote the family of all $k$ -dimensional subspaces of $V$ . The families $\mat…

math.CO2026

Extremal $t$ -intersecting families for finite sets with $t$ -covering number at least $t + 2$

Tian Yao, Dehai Liu, Kaishun Wang

Let $F \subseteq (k [ n ])$ be a $t$ -intersecting family. Define the $t$ -covering number $τ_{t} (F)$ of $F$ as the minimum size of a subset $S$ of $[n…

On Erdős--Ko--Rado and Hilton--Milner Theorems for Direct Products

Non-trivial cross-t-intersecting families for vector spaces with the maximum sum of sizes

s-almost cross-t-intersecting families for vector spaces

Extremal t-intersecting families for finite sets with t-covering number at least t+2

Non-trivial cross- $t$ -intersecting families for vector spaces with the maximum sum of sizes

$s$ -almost cross- $t$ -intersecting families for vector spaces

Extremal $t$ -intersecting families for finite sets with $t$ -covering number at least $t + 2$