2 problems

Seymour's conjecture. For positive integers $n$ and $k$ with $n\geq k+1$ and $k\geq2$, if

Let $l\geq 4$ be an integer, and let $k$ be the smallest integer greater than $2$ that does not divide $l$. Let $\delta^0(G)$ denote the minimum semi-degree of an oriented graph…