Dehai Liu

activity

20242026

collaborators

6 papers

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

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 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

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

math.CO2025

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

Dehai Liu, Kaishun Wang, Tian Yao

Two families $F$ and $G$ of $k$ -subsets of an $n$ -set are called $s$ -almost cross- $t$ -intersecting if each member in $F$ (resp. $G$ ) is $t$ -…

math.CO2024

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

Lijun Ji, Dehai Liu, Kaishun Wang +2

Let $V$ be a finite dimensional vector space over a finite field, and $F$ a family consisting of $k$ -subspaces of $V$ . The family $F$ is called $t$ -intersecting…

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

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

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

s-almost t-intersecting families for finite sets

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

s-almost t-intersecting families for vector spaces

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

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

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

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

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

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