4 problems

Let $D$ be an oriented graph on $n$ vertices, let $\bar\delta^0(D)$ denote its minimum pseudo-semidegree, and let a balanced antidirected tree have equally many sources and sinks.…

Let $\Delta\in\mathbb N$, and let $c$ be a constant. The bounded-degree spanning-tree conjecture. For every $\Delta$ there is a $c$ such that every sufficiently large $n$-vertex di…

Let $D$ be an oriented graph on $n$ vertices, let $\delta^0(D)$ denote its minimum semidegree, and let a balanced antidirected tree have equally many sources and sinks. The balance…

Let $k\in\mathbb N$, and let $\delta^0(D)$ denote the minimum semidegree of an oriented graph $D$. Stein's conjecture. Every oriented graph with $\delta^0(D)>k/2$ contains every or…