A Note on Turán Numbers and the Erdős-Stone-Simonovits Theorem
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914069531852800 |
|---|---|
| author | Gobej, Stefan |
| author_facet | Gobej, Stefan |
| contents | Given a fixed graph H, we say that a graph G is H-free if G does not contain H as a subgraph. The Turán number ex(n, H) of H is the maximum number of edges in an n-vertex H-free graph. The study of Turán number of graphs is a central topic in extremal graph theory. The purpose of this article is to present some well-known results about this field but also to prove the Erdős-Stone-Simonovits theorem in an original manner. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_00338 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Note on Turán Numbers and the Erdős-Stone-Simonovits Theorem Gobej, Stefan Combinatorics 05C35, 05C75 Given a fixed graph H, we say that a graph G is H-free if G does not contain H as a subgraph. The Turán number ex(n, H) of H is the maximum number of edges in an n-vertex H-free graph. The study of Turán number of graphs is a central topic in extremal graph theory. The purpose of this article is to present some well-known results about this field but also to prove the Erdős-Stone-Simonovits theorem in an original manner. |
| title | A Note on Turán Numbers and the Erdős-Stone-Simonovits Theorem |
| topic | Combinatorics 05C35, 05C75 |
| url | https://arxiv.org/abs/2510.00338 |