Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Spanning trees in dense directed graphs (2102.03144v2)

Published 5 Feb 2021 in math.CO

Abstract: In 2001, Koml\'os, S\'ark\"ozy and Szemer\'edi proved that, for each $\alpha>0$, there is some $c>0$ and $n_0$ such that, if $n\geq n_0$, then every $n$-vertex graph with minimum degree at least $(1/2+\alpha)n$ contains a copy of every $n$-vertex tree with maximum degree at most $cn/\log n$. We prove the corresponding result for directed graphs. That is, for each $\alpha>0$, there is some $c>0$ and $n_0$ such that, if $n\geq n_0$, then every $n$-vertex directed graph with minimum semi-degree at least $(1/2+\alpha)n$ contains a copy of every $n$-vertex oriented tree whose underlying maximum degree is at most $cn/\log n$. As with Koml\'os, S\'ark\"ozy and Szemer\'edi's theorem, this is tight up to the value of $c$. Our result improves a recent result of Mycroft and Naia, which requires the oriented trees to have underlying maximum degree at most $\Delta$, for any constant $\Delta\in \mathbb{N}$ and sufficiently large $n$. In contrast to these results, our methods do not use Szemer\'edi's regularity lemma.

Summary

We haven't generated a summary for this paper yet.