Liying Kang

activity

20222026

most citedLinear spectral Turan problems for expansions of graphs with given chromatic number

4 citations · 6 across the 16 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

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

Spectral extremal problems for degenerate graphs

Jiadong Wu, Liying Kang, Zhenyu Ni

A family of graphs is called degenerate if it contains at least one bipartite graph. In this paper, we investigate the spectral extremal problems for a degenerate family of graphs…

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…

The α-spectral Turán type problems for graphs

Spectral extremal problems for degenerate graphs

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

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