Mei Lu

activity

20242026

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Counting $t$ -wise $L$ -intersecting cliques with prescribed intersection sizes

Yiyan Zhan, Yichen Wang, Mei Lu

Let $r, t \geq 3$ be integers and $L = {ℓ_{1}, ℓ_{2}, \dots, ℓ_{s}} \subseteq [0, r - 1]$ a fixed set of integers with $∣ L ∣ \neq = r$ and $ℓ_{1} < ℓ_{2} < \dots < ℓ_{s}$ . For each integer $n$ …

math.CO2026

A generalization of Erdős-Hajnal problem on paths with equal-degree endpoints

Xiamiao Zhao, Yichen Wang, Mei Lu

Erdős and Hajnal proposed a problem that: is it true that every $(2 n + 1)$ -vertex graph with $n^{2} + n + 1$ edges contains two vertices of equal degree connected by a path of length three…

Counting t-wise L-intersecting cliques with prescribed intersection sizes

A generalization of Erdős-Hajnal problem on paths with equal-degree endpoints

Counting $t$ -wise $L$ -intersecting cliques with prescribed intersection sizes