Work

Spectral Turán problem on Berge-K2,t hypergraphs

Year: 2024
Type: article
Abstract: It is well-known that Tur?n problem is a classical problem in combinatorics, and the spectral Tur?n-type problem is the special form of Tur?n problem. Given a graph F, a hypergraph is called Ber1e-F if it can be obtained by replacing each edge in F by a hyperedge containing it. In this paper, we investigate the spectral Tur?n-type problem on linear r-uniform hypergraphs without Berge-K,2,t and attain an upper bound of its spectral radius.
Source: Filomat
Authors: Zhongxun Zhu, Liyi Zheng, Yuan Wang, Yaping Zhao
Language: English
Open Access status: diamond
OpenAlex ID: W4408927147
FWCI:
Cites: 20
Cited by:
Related to: 8