2 problems

An oriented graph is a directed graph without loops or multiple edges. For an oriented graph $G$, let $\delta^\pm(G)$ be its minimum semidegree, the smaller of its minimum indegree…

An oriented graph is a directed graph without loops or multiple edges. For an oriented graph $G$, let $\delta^+(G)$ denote its minimum outdegree, and let $C_\ell$ denote a directed…