5 citations · 13 across the 14 of their papers we have counts for
14 papers
Triangles in r-wise t-intersecting families
Jiaqi Liao, Mengyu Cao, Mei Lu
Let , , and be positive integers and a family of -subsets of an -set . The family $ \CF $ is -wise -intersecting if for any $ F_1, \l…
On the -hull numbers of -Kneser graphs and Grassmann graphs
Jiaqi Liao, Mengyu Cao, Mei Lu
Let be an -dimensional vector space over the finite field , where is necessarily a prime power. Denote (resp. ) to be the \emph{-Kn…
-cross -intersecting families for vector spaces
Mengyu Cao, Mei Lu, Benjian Lv +1
Let be an -dimensional vector space over the finite field , and denote the family of all -dimensional subspaces of . The families $\mathcal…
Non-trivial -intersecting families for the distance-regular graphs of bilinear forms
Mengyu Cao, Benjian Lv, Kaishun Wang
Let be an -dimensional vector space over a finite field, and a fixed -dimensional subspace of . Write to be the set of all -dimensiona…
Two characterizations of the grid graphs
Brhane Gebremichel, Meng-Yue Cao, Jack H. Koolen
In this paper we give two characterizations of the -grid graphs as co-edge-regular graphs with four distinct eigenvalues.
Maximality of Seidel matrices and switching roots of graphs
Meng-Yue Cao, Jack H. Koolen, Akihiro Munemasa +1
In this paper, we discuss maximality of Seidel matrices with a fixed largest eigenvalue. We present a classification of maximal Seidel matrices of largest eigenvalue , which giv…
Treewidth of the -Kneser graphs
Mengyu Cao, Ke Liu, Mei Lu +1
Let be an -dimensional vector space over a finite field , where is a prime power. Define the \emph{generalized -Kneser graph} to be the gra…
Recent progress on graphs with fixed smallest eigenvalue
Jack H. Koolen, Meng-Yue Cao, Qianqian Yang
We give a survey on graphs with fixed smallest eigenvalue, especially on graphs with large minimal valency and also on graphs with good structures. Our survey mainly consists of th…
Treewidth of the generalized Kneser graphs
Ke Liu, Mengyu Cao, Mei Lu
Let , and be integers with . The \emph{generalized Kneser graph} is a graph whose vertices are the -subsets of a fixed -set, where tw…
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…
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…
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…
On even-cycle-free subgraphs of the doubled Johnson graphs
Mengyu Cao, Benjian lv, Kaishun Wang
The generalized Turán number is the maximum number of edges in an -free subgraph of a graph It is an important extension of the classical Turán number ${\rm…
Some Remarks on Systems of Equiangular Lines
Mengyue Cao, Jack H. Koolen, Jae Young Yang
In this note, we study the maximum number of a system of equiangular lines in with cosine , where is not an odd positive integer. This note i…