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 $\mathcal{F}$, we say that a hypergraph $H$ is Berge $\mathcal{F}$-free if for every $F \in \mathcal{F}$, 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án-type problems over linear $k$-uniform hypergraphs by using spectral methods, including a tight result on Berge $C_4$-free linear $3$-uniform hypergraphs.
@article{10_37236_9018,
author = {Yuan Hou and An Chang and Joshua Cooper},
title = {Spectral extremal results for hypergraphs},
journal = {The electronic journal of combinatorics},
year = {2021},
volume = {28},
number = {3},
doi = {10.37236/9018},
zbl = {1471.05057},
url = {http://geodesic.mathdoc.fr/articles/10.37236/9018/}
}
TY - JOUR
AU - Yuan Hou
AU - An Chang
AU - Joshua Cooper
TI - Spectral extremal results for hypergraphs
JO - The electronic journal of combinatorics
PY - 2021
VL - 28
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/9018/
DO - 10.37236/9018
ID - 10_37236_9018
ER -
%0 Journal Article
%A Yuan Hou
%A An Chang
%A Joshua Cooper
%T Spectral extremal results for hypergraphs
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/9018/
%R 10.37236/9018
%F 10_37236_9018
Yuan Hou; An Chang; Joshua Cooper. Spectral extremal results for hypergraphs. The electronic journal of combinatorics, Tome 28 (2021) no. 3. doi: 10.37236/9018
