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
DOI: 10.2298/fil2409207z
Authors: Zhongxun Zhu, Liyi Zheng, Yuan Wang, Yaping Zhao
Institution: South Central Minzu University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
Award: G6932383949
OpenAlex ID: W4408927147
