1 problem

Let $G$ be a graph, and let $F:V(G)\to 2^N$ assign a set of forbidden out-degrees to each vertex. An orientation $O$ of $G$ is $F$-avoiding if $d^+_O(v)\notin F(v)$ for every…