4 citations · 6 across the 16 of their papers we have counts for
5 papers · 1 filter
On generalized Turán problems with bounded matching number
Yisai Xue, Liying Kang
The generalized Turán number is defined as the maximum number of copies of a graph in an -vertex graph that does not contain any graph $F \i…
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…
Hypergraph Extensions of Spectral Turán Theorem
Lele Liu, Zhenyu Ni, Jing Wang +1
The spectral Turán theorem states that the -partite Turán graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order containing no t…
Extremal problems for star forests and cliques
Yongchun Lu, Liying Kang
Given a family of graphs , the Turán number denotes the maximum number of edges in any -free graph on vertices. Recently, Alon an…
Spectral bipartite Turan problems on linear hypergraphs
Chuan-Ming She, Yi-Zheng Fan, Liying Kang
Let be a graph, and let be the class of -uniform Berge- hypergraphs. In this paper, we establish a relationship between the spectral radius of the adja…