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

17 papers

math.CO2026

Nonregular graphs of odd maximum degree with maximum spectral radius

Liangdong Fan, Liying Kang, Yaojun Chen

Let $ρ (n, d)$ denote the maximum adjacency spectral radius among all connected nonregular graphs of order $n$ and maximum degree $d$ . A graph attaining this maximum is called an ext…

math.CO2026

A Vertex-Linear Threshold for Eventually Turán good and the Cluster Method

Xiamiao Zhao, Liying Kang, Yuanpei Wang

A graph $H$ is $K_{r + 1}$ -Turán-good if, for every sufficiently large $n$ , the Turán graph $T_{r} (n)$ maximizes the number of copies of $H$ among all $n$ -vertex $K_{r + 1}$ -free graphs,…

math.CO2026

Turán-good monotonicity thresholds

Yuanpei Wang, Liying Kang, Xiamiao Zhao

A graph $H$ is $K_{r + 1}$ -Turán-good if, for every sufficiently large $n$ , the Turán graph $T_{r} (n)$ maximizes the number of copies of $H$ among all $n$ -vertex $K_{r + 1}$ -free graphs.…

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 spectral inducibility of graphs

Liying Kang, Xizhi Liu, Yongchun Lu

We introduce a spectral version of the classical inducibility problem. Given an $ℓ$ -vertex graph $F$ and an $n$ -vertex graph $G$ , let $H_{F} (G)$ be the $ℓ$ -uniform hypergraph w…

math.CO2026

Spectral Turán Problems for Expanded hypergraphs

Zhenyu Ni, Dongquan Cheng, Jing Wang +1

Given a graph $F$ , the expansion $F^{(r)}$ of $F$ is defined as the $r$ -uniform hypergraph obtained from $F$ by adding a set of $(r - 2)$ distinct new vertices to each edge of $F$ . I…

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

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…

math.CO2024

On generalized Turán problems with bounded matching number

Yisai Xue, Liying Kang

The generalized Turán number $ex (n, H, F)$ is defined as the maximum number of copies of a graph $H$ in an $n$ -vertex graph that does not contain any graph $F \i…

math.CO2024

Spectral Extremal Graphs of Planar Graphs with Fixed Size

Liangdong Fan, Liying Kang, Jiadong Wu

Tait and Tobin [J. Combin. Theory Ser. B 126 (2017) 137--161] determined the unique spectral extremal graph over all outerplanar graphs and the unique spectral extremal graph over…

math.CO2024

Hypergraph Extensions of Spectral Turán Theorem

Lele Liu, Zhenyu Ni, Jing Wang +1

The spectral Turán theorem states that the $k$ -partite Turán graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no t…

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…

math.CO2024★ 2 cited

Spectral bipartite Turan problems on linear hypergraphs

Chuan-Ming She, Yi-Zheng Fan, Liying Kang

Let $F$ be a graph, and let $B_{r} (F)$ be the class of $r$ -uniform Berge- $F$ hypergraphs. In this paper, we establish a relationship between the spectral radius of the adja…

math.CO2023

Extremal graphs without long paths and a given graph

Yichong Liu, Liying Kang

For a family of graphs $F$ , the Turán number $e x (n, F)$ is the maximum number of edges in an $n$ -vertex graph containing no member of $F$ as a subgraph…

math.CO2022★ 4 cited

Linear spectral Turan problems for expansions of graphs with given chromatic number

Chuan-Ming She, Yi-Zheng Fan, Liying Kang +1

An $r$ -uniform hypergraph is linear if every two edges intersect in at most one vertex. The $r$ -expansion $F^{r}$ of a graph $F$ is the $r$ -uniform hypergraph obtained from $F$ by…

Nonregular graphs of odd maximum degree with maximum spectral radius

A Vertex-Linear Threshold for Eventually Turán good and the Cluster Method

Turán-good monotonicity thresholds

A Spectral Confirmation of the Erdős Matching Conjecture

The spectral inducibility of graphs

Spectral Turán Problems for Expanded hypergraphs

The signless Laplacian spectral Turán problems for hypergraphs

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

On generalized Turán problems with bounded matching number

Spectral Extremal Graphs of Planar Graphs with Fixed Size

Hypergraph Extensions of Spectral Turán Theorem

Extremal problems for star forests and cliques

Spectral bipartite Turan problems on linear hypergraphs

Extremal graphs without long paths and a given graph

Linear spectral Turan problems for expansions of graphs with given chromatic number

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