Spectral bipartite Turan problems on linear hypergraphs
arXiv:2403.02064 · doi:10.1016/j.disc.2025.114435
Abstract
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 adjacency tensor of a uniform hypergraph and its local structure through walks. Based on the relationship, we give a spectral asymptotic bound for -free linear -uniform hypergraphs and upper bounds for the spectral radii of -free or -free linear -uniform hypergraphs, where and are respectively the triangle and the complete bipartite graph with one part having vertices and the other part having vertices. Our work implies an upper bound for the number of edges of -free linear -uniform hypergraphs and extends some of the existing research on (spectral) extremal problems of hypergraphs.
References in corpus (4)
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph
- The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
- Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs