An Erdős-Stone type result for high-order spectra of graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866907824679813120 |
|---|---|
| author | Liu, Chunmeng Zhou, Jiang Bu, Changjiang |
| author_facet | Liu, Chunmeng Zhou, Jiang Bu, Changjiang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_13368 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | An Erdős-Stone type result for high-order spectra of graphs Liu, Chunmeng Zhou, Jiang Bu, Changjiang Combinatorics 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. |
| title | An Erdős-Stone type result for high-order spectra of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2311.13368 |