Mei Lu

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2024

Turán number of complete bipartite graphs with bounded matching number

Huan Luo, Xiamiao Zhao, Mei Lu

Let $F$ be a family of graphs. A graph $G$ is $F$ -free if $G$ does not contain any $F \in F$ as a subgraph. The Turán number $e x (n, F)$ is th…

math.CO2014★ 1 cited

Linearized Wenger graphs

Xiwang Cao, Mei Lu, Daqing Wan +2

Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, di…