5 problems

Let $G$ be an oriented graph, and let $4\delta^0(G)4$ denote its minimum semidegree, the minimum of the in-degree and out-degree over all vertices. An oriented path of length…

Let $G$ be an oriented graph. Its minimum pseudo-semidegree $\bar{\delta}^0(G)$ is the minimum among all non-zero in-degrees and out-degrees of its vertices; equivalently, it is th…

Let $G$ be an oriented graph, let $\b7$ denote its minimum semidegree, and let $k$ be a nonnegative integer. An orientation of the $k$-edge path is an oriented graph obtained by as…

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 and multiple edges. For an oriented graph $G$, let $\delta^\pm(G)$ denote its minimum semidegree, the smaller of its minimum ind…