L. Kang

activity

20142023

most citedOn the principal eigenvectors of uniform hypergraphs

20 citations · 37 across the 21 of their papers we have counts for

collaborators

21 papers

math.CO2023

Extremal problems for disjoint graphs

Zhenyu Ni, Jing Wang, Liying Kang

For a simple graph $F$ , let $EX (n, F)$ and $E X_{sp} (n, F)$ be the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral ra…

math.CO2023

Spectral extremal graphs for edge blow-up of star forests

Jing Wang, Zhenyu Ni, Liying Kang +1

The edge blow-up of a graph $G$ , denoted by $G^{p + 1}$ , is obtained by replacing each edge of $G$ with a clique of order $p + 1$ , where the new vertices of the cliques are all distinc…

math.CO2022

Stability of generalized Turán number for linear forests

Yisai Xue, Yichong Liu, Liying Kang

Given a graph $T$ and a family of graphs $F$ , the generalized Turán number of $F$ is the maximum number of copies of $T$ in an $F$ -free graph on $n$ v…

math.CO2022

Spectral extremal graphs for disjoint cliques

Zhenyu Ni, Jing Wang, Liying Kang

The $k K_{r + 1}$ is the union of $k$ disjoint copies of $(r + 1)$ -clique. Moon [Canad. J. Math. 20 (1968) 95--102] and Simonovits [Theory of Graphs (Proc. colloq., Tihany, 1996)] indep…

math.CO2022

On a conjecture of spectral extremal problems

Jing Wang, Liying Kang, Yusai Xue

For a simple graph $F$ , let $Ex (n, F)$ and $E x_{sp} (n, F)$ denote the set of graphs with the maximum number of edges and the set of graphs with the maximum spectra…

math.CO2021

Solution to a Forcible Version of a Graphic Sequence Problem

Mao-cheng Cai, Liying Kang

Let $A_{n} = (a_{1}, a_{2}, \dots, a_{n})$ and $B_{n} = (b_{1}, b_{2}, \dots, b_{n})$ be nonnegative integer sequences with $A_{n} \leq B_{n}$ . The purpose of this note is to give a good characterization such t…