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 2026Show all

7 papers · 1 filter

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…