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

8 citations · 28 across the 30 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

math.CO2020

Non-trivial -intersecting families for symplectic polar spaces

Tian Yao, Benjian Lv, Kaishun Wang

Let be a symplectic polar space over a finite field , and denote the set of all -dimensional subspaces in . We say a …

math.CO2020

Extremal even-cycle-free subgraphs of the complete transposition graphs

Mengyu Cao, Benjian Lv, Kaishun Wang +1

Given graphs and , the generalized Turán number is the maximum number of edges in an -free subgraph of . In this paper, we obtain an asymptotic upper b…

math.CO2020★ 2 cited

The structure of large non-trivial t-intersecting families for finite sets

Mengyu Cao, Benjian Lv, Kaishun Wang

In this paper, we describe the structure of maximal non-trivial uniform -intersecting families with large size for finite sets. In the special case when , our result gives…

math.CO2020★ 5 cited

Non-trivial -intersecting families for vector spaces

Mengyu Cao, Benjian Lv, Kaishun Wang +1

Let be an -dimensional vector space over a finite field . In this paper we describe the structure of maximal non-trivial -intersecting families of -dimen…

math.CO2020

Extremal -intersecting families for direct products

Tian Yao, Benjian Lv, Kaishun Wang

In this paper, by shifting technique we study -intersecting families for direct products where the ground set is divided into several parts. Assuming the size of each part is su…

math.CO2020

Intersecting families of vector spaces with maximum covering number

Chao Gong, Benjian Lv, Kaishun Wang

Let be an -dimensional vector space over the finite field . Suppose that is an intersecting family of -dimensional subspaces of . The cover…