Paperlane

no. 11 · Monday 9 November 2026

On the Motzkin-Straus theorem and clique number for k-uniform hypergraphs

Chunli Deng, Shaohuan Hao and Haifeng Li

math.CO

Abstract

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.

fields
Combinatorics
pdf ↗ page arXiv:2611.09357 ↗