Kaishun Wang

activity

20242026

collaborators

9 papers

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

Extremal cross $t$ -intersecting families under $t$ -covering number constraints for vector spaces

Yu Zhu, Benjian Lv, Kaishun Wang

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 $\mathcal…

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

On extremal cross $t$ -intersecting families with $t$ -covering number conditions

Yu Zhu, Benjian Lv, Kaishun Wang

Let $n$ , $k$ and $t$ be positive integers, and let $F$ be a collection of $k$ -subsets of $[n] = {1, 2, \dots, n}$ . The $t$ -covering number $I ¨ _{t} (F)$ of $\mathcal{F…

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 $I ¨ _{t} (F)$ of $F$ as the minimum size of a subset $S$ of $[…

math.CO2026

$s$ -almost $t$ -intersecting families for finite sets

Dehai Liu, Kaishun Wang, Tian Yao

A family $F$ of $k$ -subsets of an $n$ -set is called $s$ -almost $t$ -intersecting if each member is $t$ -disjoint with at most $s$ members. In this paper, we prove that, if…

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

Extremal cross t-intersecting families under t-covering number constraints for vector spaces

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

On extremal cross t-intersecting families with t-covering number conditions

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

s-almost t-intersecting families for finite sets

Extremal cross $t$ -intersecting families under $t$ -covering number constraints for vector spaces

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

On extremal cross $t$ -intersecting families with $t$ -covering number conditions

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

$s$ -almost $t$ -intersecting families for finite sets