English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $T$ be an oriented tree on $n$ vertices with maximum degree at most$e^{o(\sqrt{\log n})}$. If $G$ is a digraph on $n$ vertices with minimumsemidegree $\delta^0(G)\geq(\frac12+o(1))n$, then $G$ contains $T$ as aspanning tree, as recently shown by Kathapurkar and Montgomery (in fact, theyonly require maximum degree $o(n/\log n)$). This generalizes the correspondingresult by Koml\'os, S\'ark\"ozy and Szemer\'edi for graphs. We investigate thenatural question how many copies of $T$ the digraph $G$ contains. Our mainresult states that every such $G$ contains at least$|Aut(T)|^{-1}(\frac12-o(1))^nn!$ copies of $T$, which is optimal. This impliesthe analogous result in the undirected case.

Counting oriented trees in digraphs with large minimum semidegree