Yongchun Lu

activity

20242026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

A Spectral Confirmation of the Erdős Matching Conjecture

Liying Kang, Yongchun Lu, Xiying Yuan +1

The Erdős Matching Conjecture concerns the maximum number of hyperedges in an $r$ -uniform hypergraph with bounded matching number. In this paper, we study a spectral counterpart of…

math.CO2026

The signless Laplacian spectral Turán problems for hypergraphs

Yongchun Lu, Jiadong Wu, Liying Kang

Let $H = (V, E)$ be an $r$ -uniform hypergraph on $n$ vertices. The signless Laplacian spectral radius of $H$ is defined as the maximum modulus of the eigenvalues…

math.CO2025

The $α$ -spectral Turán type problems for graphs

Jiadong Wu, Yongchun Lu, Liying Kang

For $0 \leq α < 1$ , the $α$ -spectral radius of a graph $G$ is defined as the largest eigenvalue of $A_{α} (G) = α D (G) + (1 - α) A (G)$ , where $D (G)$ and $A (G)$ are the diagonal matrix of degre…

math.CO2025

On generalized Tur{á}n problems with bounded matching number and circumference

Yongchun Lu, Liying Kang, Yisai Xue

Let $ \mathcal{F} $ be a family of graphs. The generalized Turán number $ \operatorname{ex}(n, K_r, \mathcal{F}) $ is the maximum number of $K_{r}$ in an $ n $-vertex graph tha…

math.CO2024

Extremal problems for star forests and cliques

Yongchun Lu, Liying Kang

Given a family of graphs $F$ , the Turán number $e x (n, F)$ denotes the maximum number of edges in any $F$ -free graph on $n$ vertices. Recently, Alon an…