Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2207.06384 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912068388519936 |
|---|---|
| author | Benford, Alistair Montgomery, Richard |
| author_facet | Benford, Alistair Montgomery, Richard |
| contents | Sumner's universal tournament conjecture states that every $(2n-2)$-vertex tournament should contain a copy of every $n$-vertex oriented tree. If we know the number of leaves of an oriented tree, or its maximum degree, can we guarantee a copy of the tree with fewer vertices in the tournament? Due to work initiated by Häggkvist and Thomason (for number of leaves) and Kühn, Mycroft and Osthus (for maximum degree), it is known that improvements can be made over Sumner's conjecture in some cases, and indeed sometimes an $(n+o(n))$-vertex tournament may be sufficient.
In this paper, we give new results on these problems. Specifically, we show
i) for every $α>0$, there exists $n_0\in\mathbb{N}$ such that, whenever $n\geqslant n_0$, every $((1+α)n+k)$-vertex tournament contains a copy of every $n$-vertex oriented tree with $k$ leaves, and
ii) for every $α>0$, there exists $c>0$ and $n_0\in\mathbb{N}$ such that, whenever $n\geqslant n_0$, every $(1+α)n$-vertex tournament contains a copy of every $n$-vertex oriented tree with maximum degree $Δ(T)\leqslant cn$.
Our first result gives an asymptotic form of a conjecture by Havet and Thomassé, while the second improves a result of Mycroft and Naia which applies to trees with polylogarithmic maximum degree. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_06384 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Trees with many leaves in tournaments Benford, Alistair Montgomery, Richard Combinatorics Sumner's universal tournament conjecture states that every $(2n-2)$-vertex tournament should contain a copy of every $n$-vertex oriented tree. If we know the number of leaves of an oriented tree, or its maximum degree, can we guarantee a copy of the tree with fewer vertices in the tournament? Due to work initiated by Häggkvist and Thomason (for number of leaves) and Kühn, Mycroft and Osthus (for maximum degree), it is known that improvements can be made over Sumner's conjecture in some cases, and indeed sometimes an $(n+o(n))$-vertex tournament may be sufficient. In this paper, we give new results on these problems. Specifically, we show i) for every $α>0$, there exists $n_0\in\mathbb{N}$ such that, whenever $n\geqslant n_0$, every $((1+α)n+k)$-vertex tournament contains a copy of every $n$-vertex oriented tree with $k$ leaves, and ii) for every $α>0$, there exists $c>0$ and $n_0\in\mathbb{N}$ such that, whenever $n\geqslant n_0$, every $(1+α)n$-vertex tournament contains a copy of every $n$-vertex oriented tree with maximum degree $Δ(T)\leqslant cn$. Our first result gives an asymptotic form of a conjecture by Havet and Thomassé, while the second improves a result of Mycroft and Naia which applies to trees with polylogarithmic maximum degree. |
| title | Trees with many leaves in tournaments |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2207.06384 |