Benjian Lv

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

30 papers

math.GR2026

Automorphism groups of Cayley graphs on almost simple groups with normal connection sets

Mengyu Cao, Benjian Lv, Binzhou Xia

We determine the full automorphism group of every connected Cayley graph on an almost simple group with a normal connection set. We also characterize exactly when the full automorp…

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

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 $τ_{t} (F)$ of $\mathcal{F}…

math.CO2024

A Bollobáss-type theorem on singular linear spaces

Erfei Yue, Benjian Lv, Péter Sziklai +1

Bollobás-type theorem determines the maximum cardinality of a Bollobás system of sets. The original result has been extended to various mathematical structures beyond sets, includi…

math.CO2022

Some intersection theorems for finite sets

Mengyu Cao, Mei Lu, Benjian Lv +1

Let $n$ , $r$ , $k_{1}, \dots, k_{r}$ and $t$ be positive integers with $r \geq 2$ , and $F_{i} (1 \leq i \leq r)$ a family of $k_{i}$ -subsets of an $n$ -set $V$ . The families $\mathcal…

math.CO2022

$r$ -cross $t$ -intersecting families for vector spaces

Mengyu Cao, Mei Lu, Benjian Lv +1

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

Large non-trivial $t$ -intersecting families for signed sets

Tian Yao, Benjian Lv, Kaishun Wang

For positive integers $n, r, k$ with $n \geq r$ and $k \geq 2$ , a set ${(x_{1}, y_{1}), (x_{2}, y_{2}), \dots, (x_{r}, y_{r})}$ is called a $k$ -signed $r$ -set on $[n]$ if $x_{1}, \dots, x_{r}$ are distinct ele…

math.CO2021

Non-trivial $t$ -intersecting families for the distance-regular graphs of bilinear forms

Mengyu Cao, Benjian Lv, Kaishun Wang

Let $V$ be an $(n + ℓ)$ -dimensional vector space over a finite field, and $W$ a fixed $ℓ$ -dimensional subspace of $V$ . Write $[n , 0 V]$ to be the set of all $n$ -dimensiona…

math.CO2020

Non-trivial $t$ -intersecting families for symplectic polar spaces

Tian Yao, Benjian Lv, Kaishun Wang

Let $P$ be a symplectic polar space over a finite field $F_{q}$ , and $P_{m}$ denote the set of all $m$ -dimensional subspaces in $P$ . We say a $t$ …

math.CO2020

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

Mengyu Cao, Benjian Lv, Kaishun Wang +1

Given graphs $G$ and $H$ , the generalized Turán number $ex (G, H)$ is the maximum number of edges in an $H$ -free subgraph of $G$ . 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 $t$ -intersecting families with large size for finite sets. In the special case when $t = 1$ , our result gives…

math.CO2020★ 5 cited

Non-trivial $t$ -intersecting families for vector spaces

Mengyu Cao, Benjian Lv, Kaishun Wang +1

Let $V$ be an $n$ -dimensional vector space over a finite field $F_{q}$ . In this paper we describe the structure of maximal non-trivial $t$ -intersecting families of $k$ -dimen…

math.CO2020

Extremal $t$ -intersecting families for direct products

Tian Yao, Benjian Lv, Kaishun Wang

In this paper, by shifting technique we study $t$ -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 $V$ be an $n$ -dimensional vector space over the finite field $F_{q}$ . Suppose that $F$ is an intersecting family of $m$ -dimensional subspaces of $V$ . The cover…

math.CO2019★ 1 cited

On even-cycle-free subgraphs of the doubled Johnson graphs

Mengyu Cao, Benjian lv, Kaishun Wang

The generalized Turán number $ex (G, H)$ is the maximum number of edges in an $H$ -free subgraph of a graph $G .$ It is an important extension of the classical Turán number ${\rm…

math.CO2019★ 1 cited

Non-trivial intersecting families for finite affine spaces

Chao Gong, Benjian Lv, Kaishun Wang

Guo and Xu determined the maximum size of intersecting families over finite affine spaces and showed that any family reaches maximum size must be trivial. In this paper, we charact…

math.CO2017

Weakly distance-regular digraphs whose attached association schemes are regular

Yuefeng Yang, Benjian Lv, Kaishun Wang

In this paper, we study commutative weakly distance-regular digraphs whose attached association schemes are regular, and give a characterization of mixed arcs. As an application, w…

math.CO2017

Two bounds for generalized $3$ -connectivity of Cartesian product graphs

Hui Gao, Benjian Lv, Kaishun Wang

The generalized $k$ -connectivity $κ_{k} (G)$ of a graph $G$ , which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let $G$ and $H…

math.CO2017

Vector spaces and Grassmann graphs over residue class rings

Li-Ping Huang, Benjian Lv, Kaishun Wang

Let $Z_{p^{s}}$ be the residue class ring of integers modulo $p^{s}$ , where $p$ is a prime number and $s$ is a positive integer. Using matrix representation and the inner rank…

math.CO2017★ 1 cited

On 3-equivalenced weakly distance-regular digraphs

Yuefeng Yang, Benjian Lv, Kaishun Wang

A weakly distance-regular digraph is 3-equivalenced if its attached association scheme is 3-equivalenced. In this paper, we classify the family of such digraphs under the assumptio…

math.CO2016

Weakly distance-regular digraphs of valency three, II

Yuefeng Yang, Benjian Lv, Kaishun Wang

In this paper, we classify commutative weakly distance-regular digraphs of valency 3 with girth more than 2 and one type of arcs. Combining [8, Theorem 1.2], [10, Theorem 1.3] and…

math.CO2016★ 3 cited

Quasi-thin weakly distance-regular digraphs

Yuefeng Yang, Benjian Lv, Kaishun Wang

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular dig…

math.CO2016

Quasi-thin weakly distance-regular digraphs,I

Yuefeng Yang, Benjian Lv, Kaishun Wang

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we show that the valency of any commutative quasi-thin weakly…

math.CO2015★ 8 cited

Weakly distance-regular digraphs of valency three, I

Yuefeng Yang, Benjian Lv, Kaishun Wang

Suzuki (2004) [7] classified thin weakly distance-regular digraphs and pro- posed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was cla…

Automorphism groups of Cayley graphs on almost simple groups with normal connection sets

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

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

A Bollobáss-type theorem on singular linear spaces

Some intersection theorems for finite sets

r-cross t-intersecting families for vector spaces

Large non-trivial t-intersecting families for signed sets

Non-trivial t-intersecting families for the distance-regular graphs of bilinear forms

Non-trivial t-intersecting families for symplectic polar spaces

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

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

Non-trivial t-intersecting families for vector spaces

Extremal t-intersecting families for direct products

Intersecting families of vector spaces with maximum covering number

On even-cycle-free subgraphs of the doubled Johnson graphs

Non-trivial intersecting families for finite affine spaces

Weakly distance-regular digraphs whose attached association schemes are regular

Two bounds for generalized 3-connectivity of Cartesian product graphs

Vector spaces and Grassmann graphs over residue class rings

On 3-equivalenced weakly distance-regular digraphs

Weakly distance-regular digraphs of valency three, II

Quasi-thin weakly distance-regular digraphs

Quasi-thin weakly distance-regular digraphs,I

Weakly distance-regular digraphs of valency three, I

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

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

$r$ -cross $t$ -intersecting families for vector spaces

Large non-trivial $t$ -intersecting families for signed sets

Non-trivial $t$ -intersecting families for the distance-regular graphs of bilinear forms

Non-trivial $t$ -intersecting families for symplectic polar spaces

Non-trivial $t$ -intersecting families for vector spaces

Extremal $t$ -intersecting families for direct products

Two bounds for generalized $3$ -connectivity of Cartesian product graphs