An Erdős-Stone type result for high-order spectra of graphs

Abstract

Erdős-Stone Theorem is a well-known result in extremal graph theory which determines the asymptotic behaviour of maximum number of edges in an $n$-vertex $H$-free graph. In 2009, Nikiforov gave a spectral version of Erdős-Stone Theorem. In this paper, we obtain a tensor's spectral version of Erdős-Stone Theorem.