Spectral Extremal Results for Hypergraphs

Author(s)

Yuan Hou
An Chang
Joshua Cooper, University of South CarolinaFollow

Document Type

Article

Abstract

Let F be a graph. A hypergraph is called Berge F if it can be obtained by replacing each edge in F by a hyperedge containing it. Given a family of graphs F, we say that a hypergraph H is Berge F-free if for every F ∈ F, the hypergraph H does not contain a Berge F as a subhypergraph. In this paper we investigate on the connections between spectral radius of the adjacency tensor and structural properties of a linear hypergraph. In particular, we obtain a spectral version of Turán-type problems over linear k-uniform hypergraphs by using spectral methods.

Digital Object Identifier (DOI)

https://doi.org/10.37236/9018

Publication Info

Published in Electronic Journal of Combinatorics, Volume 28, Issue 3, 2021.

APA Citation

Hou, Y., Chang, A., & Cooper, J. (2021). Spectral Extremal Results for Hypergraphs. The Electronic Journal of Combinatorics, 28(3).https://doi.org/10.37236/9018

Rights

©The authors. Released under the CC BY-ND licenseInternational 4.0.