1 problem

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…