Spectral extremal results for hypergraphs

From MaRDI portal




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 mathcalF, we say that a hypergraph H is Berge mathcalF-free if for every FinmathcalF, the hypergraph H does not contain a Berge F as a subhypergraph. In this paper we investigate 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'{a}n-type problems over linear k-uniform hypergraphs by using spectral methods, including a tight result on Berge C4-free linear 3-uniform hypergraphs.



Cites work









This page was built for publication: Spectral extremal results for hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049621)