Antidirected subgraphs of oriented graphs
Antidirected subgraphs of oriented graphs
Abstract We show that for every $\eta \gt 0$ every sufficiently large $n$ -vertex oriented graph $D$ of minimum semidegree exceeding $(1+\eta )\frac k2$ contains every balanced antidirected tree with $k$ edges and bounded maximum degree, if $k\ge \eta n$ . In particular, this asymptotically confirms a conjecture of the …