Mei Lu

activity

20242026

collaborators

5 papers

math.CO2026

Extremal results on Berge disjoint paths

Xiamiao Zhao, Yiyan Zhan, Mei Lu

The well-known Erdős-Gallai Theorem gave the Turán number of paths. Bushaw and Kettle generalized this result to consider the Turán number of disjoint paths. Since then, many studi…

math.CO2025

Turán type problems for a fixed graph and a linear forest

Haixiang Zhang, 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, denoted by $ex(n, \mathsc…

math.CO2024

The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs

Hui Lei, Mei Lu, Yongtang Shi +2

Constructing the maximum spanning tree $T$ of an edge-weighted connected graph $G$ is one of the important research topics in computer science and optimization, and the related res…

math.CO2024

Generalized Turán problems for a matching and long cycles

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 general Turán number, denoted by $ex(n,…

math.CO2024

Partite saturation number of cycles

Yiduo Xu, Zhen He, Mei Lu

A graph $H$ is said to be $F$ -saturated relative to $G$ , if $H$ does not contain any copy of $F$ , but the addition of any edge $e$ in $E (G) \ E (H)$ would create a copy of $…