pith. sign in

arxiv: 2311.13368 · v2 · pith:ENGBA7FYnew · submitted 2023-11-22 · 🧮 math.CO

An ErdH{o}s-Stone type result for high-order spectra of graphs

classification 🧮 math.CO
keywords s-stonetheoremgraphresultspectralversionasymptoticbehaviour
0
0 comments X
read the original abstract

Erd\H{o}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\H{o}s-Stone Theorem. In this paper, we obtain a tensor's spectral version of Erd\H{o}s-Stone Theorem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.