Oriented Trees in Digraphs without Oriented $4$-cycles
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929599209799680 |
|---|---|
| author | Stein, Maya Trujillo-Negrete, Ana |
| author_facet | Stein, Maya Trujillo-Negrete, Ana |
| contents | We prove that if $D$ is a digraph of maximum outdegree and indegree at least $k$, and minimum semidegree at least $k/2$ that contains no oriented $4$-cycles, then $D$ contains each oriented tree $T$ with~$k$ arcs. This can be slightly improved if $T$ is either antidirected or an arborescence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_13483 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Oriented Trees in Digraphs without Oriented $4$-cycles Stein, Maya Trujillo-Negrete, Ana Combinatorics 05C05, 05C20, 05C35 We prove that if $D$ is a digraph of maximum outdegree and indegree at least $k$, and minimum semidegree at least $k/2$ that contains no oriented $4$-cycles, then $D$ contains each oriented tree $T$ with~$k$ arcs. This can be slightly improved if $T$ is either antidirected or an arborescence. |
| title | Oriented Trees in Digraphs without Oriented $4$-cycles |
| topic | Combinatorics 05C05, 05C20, 05C35 |
| url | https://arxiv.org/abs/2411.13483 |