2 citations · 2 across the 5 of their papers we have counts for
9 papers · 1 filter
Stability of generalized Turán number for linear forests
Yisai Xue, Yichong Liu, Liying Kang
Given a graph and a family of graphs , the generalized Turán number of is the maximum number of copies of in an -free graph on v…
On a conjecture of spectral extremal problems
Jing Wang, Liying Kang, Yusai Xue
For a simple graph , let and denote the set of graphs with the maximum number of edges and the set of graphs with the maximum spectra…
Solution to a Forcible Version of a Graphic Sequence Problem
Mao-cheng Cai, Liying Kang
Let and be nonnegative integer sequences with . The purpose of this note is to give a good characterization such t…
Spectral extremal graphs for intersecting cliques
Dheer Noal Desai, Liying Kang, Yongtao Li +3
The -fan is the graph consisting of copies of the complete graph which intersect in a single vertex, and is denoted by . Erdős, Füredi, Gould and Gunderso…
The extremal -spectral radius of Berge-hypergraphs
Liying Kang, Lele Liu, Linyuan Lu +1
Let be a graph. We say that a hypergraph is a Berge- if there is a bijection such that for all . For any -uniform hyper…
The largest spectral radius of uniform hypertrees with a given size of matching
Li Su, Liying Kang, Honghai Li +1
In this paper, using the theory of matching polynomial of hypertrees and ordering of hypertrees, we determine the largest spectral radius of hypertrees with edges and given siz…