activity
20092026
most citedWeakly distance-regular digraphs of valency three, I

8 citations · 52 across the 81 of their papers we have counts for

collaborators

84 papers

math.CO2026

The complete nontrivial-intersection theorem for vector spaces

Dehai Liu, Benjian Lv, Kaishun Wang +1

A family of -subspaces of an -dimensional vector space over a finite field is -intersecting if any two members intersect in a subspace of dimension at least . A -int…

math.CO2026

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

Tian Yao, Mengyu Cao, Kaishun Wang

We investigate -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 -intersecting families under -covering number constraints for vector spaces

Yu Zhu, Benjian Lv, Kaishun Wang

Let be an -dimensional vector space over the finite field , and denote the family of all -dimensional subspaces of . The families $\mathcal…

math.CO2026

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

Dehai Liu, Kaishun Wang, Tian Yao

Let be an -dimensional vector space over a finite field. Suppose that and are non-empty families of -subspaces and -subspaces of , re…

math.CO2026

On extremal cross -intersecting families with -covering number conditions

Yu Zhu, Benjian Lv, Kaishun Wang

Let , and be positive integers, and let be a collection of -subsets of . The -covering number of $\mathcal{F}…

math.CO2026

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

Tian Yao, Dehai Liu, Kaishun Wang

Let be a -intersecting family. Define the -covering number of as the minimum size of a subset of $[n…