4 papers
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 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…
On generalized Tur{á}n problems with bounded matching number and circumference
Yongchun Lu, Liying Kang, Yisai Xue
Let \( \mathcal{F} \) be a family of graphs. The generalized Turán number \( \operatorname{ex}(n, K_r, \mathcal{F}) \) is the maximum number of in an \( n \)-vertex graph th…