10 papers
Turán-good monotonicity thresholds
Yuanpei Wang, Liying Kang, Xiamiao Zhao
A graph is -Turán-good if, for every sufficiently large , the Turán graph maximizes the number of copies of among all -vertex -free graphs.…
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 -uniform hypergraph with bounded matching number. In this paper, we study a spectral counterpart o…
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 and an -vertex graph , let be the -uniform hypergraph w…
Spectral Turán Problems for Expanded hypergraphs
Zhenyu Ni, Dongquan Cheng, Jing Wang +1
Given a graph , the expansion of is defined as the -uniform hypergraph obtained from by adding a set of distinct new vertices to each edge of . I…
The signless Laplacian spectral Turán problems for hypergraphs
Yongchun Lu, Jiadong Wu, Liying Kang
Let be an -uniform hypergraph on vertices. The signless Laplacian spectral radius of is defined as the maximum modulus of the eigenvalues…
The -spectral Turán type problems for graphs
Jiadong Wu, Yongchun Lu, Liying Kang
For , the -spectral radius of a graph is defined as the largest eigenvalue of , where and are the diagonal matrix of…