An Erd\H{o}s-Stone type result for high-order spectra of graphs
Combinatorics
2024-03-11 v2
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 -vertex -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.
Keywords
Cite
@article{arxiv.2311.13368,
title = {An Erd\H{o}s-Stone type result for high-order spectra of graphs},
author = {Chunmeng Liu and Jiang Zhou and Changjiang Bu},
journal= {arXiv preprint arXiv:2311.13368},
year = {2024}
}