On the supersaturation of oriented Turán problems
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918339578691584 |
|---|---|
| author | Hu, Xuanrui Sun, Yuefang |
| author_facet | Hu, Xuanrui Sun, Yuefang |
| contents | The oriented Turán number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$-free oriented graphs. This parameter could be seen as a natural oriented version of the classical Turán number. In this paper, we study the supersaturation phenomenon for oriented Turán problems, and prove oriented versions of the famous Erdős-Simonovits Supersaturation Theorem and Moon-Moser inequality, and supersaturation theorems for transitive tournaments and antidirected complete bipartite graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_14008 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the supersaturation of oriented Turán problems Hu, Xuanrui Sun, Yuefang Combinatorics The oriented Turán number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$-free oriented graphs. This parameter could be seen as a natural oriented version of the classical Turán number. In this paper, we study the supersaturation phenomenon for oriented Turán problems, and prove oriented versions of the famous Erdős-Simonovits Supersaturation Theorem and Moon-Moser inequality, and supersaturation theorems for transitive tournaments and antidirected complete bipartite graphs. |
| title | On the supersaturation of oriented Turán problems |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2602.14008 |