3 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 $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$, let $D$ be a digraph, and let $T$ be an antidirected tree with $k$ edges. Addario-Berry et al.'s conjecture. Every digraph $D$ with more than $(k-1)|V(D)|$ edg…