Antipaths in oriented graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929234524504064 |
|---|---|
| author | Klimošová, Tereza Stein, Maya |
| author_facet | Klimošová, Tereza Stein, Maya |
| contents | We show that for any natural number $k \ge 1$, any oriented graph $D$ of minimum semidegree at least $(3k- 2)/4$ contains an antidirected path of length $k$. In fact, a slightly weaker condition on the semidegree sequence of $D$ suffices, and as a consequence, we confirm a weakened antidirected path version of a conjecture of Addario-Berry, Havet, Linhares Sales, Thomassé and Reed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_09876 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Antipaths in oriented graphs Klimošová, Tereza Stein, Maya Combinatorics We show that for any natural number $k \ge 1$, any oriented graph $D$ of minimum semidegree at least $(3k- 2)/4$ contains an antidirected path of length $k$. In fact, a slightly weaker condition on the semidegree sequence of $D$ suffices, and as a consequence, we confirm a weakened antidirected path version of a conjecture of Addario-Berry, Havet, Linhares Sales, Thomassé and Reed. |
| title | Antipaths in oriented graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2212.09876 |