Semidegree threshold for spanning trees in oriented graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914386461851648 |
|---|---|
| author | Araújo, Pedro Santos, Giovanne Stein, Maya |
| author_facet | Araújo, Pedro Santos, Giovanne Stein, Maya |
| contents | We show that for all $γ> 0$ and $Δ\in \mathbb{N}$, there is some $n_0$ such that, if $n \geq n_0$, then every oriented graph on $n$ vertices with minimum semidegree at least $(3/8 + γ)n$ contains a copy of each oriented tree on $n$ vertices with maximum degree at most $Δ$. This is asymptotically best possible. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_10951 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Semidegree threshold for spanning trees in oriented graphs Araújo, Pedro Santos, Giovanne Stein, Maya Combinatorics We show that for all $γ> 0$ and $Δ\in \mathbb{N}$, there is some $n_0$ such that, if $n \geq n_0$, then every oriented graph on $n$ vertices with minimum semidegree at least $(3/8 + γ)n$ contains a copy of each oriented tree on $n$ vertices with maximum degree at most $Δ$. This is asymptotically best possible. |
| title | Semidegree threshold for spanning trees in oriented graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.10951 |