On the Motzkin-Straus theorem and clique number for k-uniform hypergraphs
In this paper, we establish a Motzkin-Straus type equality for k-uniform hypergraphs under certain conditions, which extends the classical Motzkin--Straus theorem for graphs. Using this equality, we present several spectral bounds for the clique number of k-uniform hypergraphs in terms of the spectral radii of the adjacency, signless Laplacian, and Laplacian tensors. When k=2, the bounds coincide with the corresponding known results for graphs.
math.CO↗