1 problem

Let $\mathcal{G}$ be a directed acyclic graph with skeleton $G$, and let $i$ be a vertex. Define $\mathcal{G}_{\downarrow i}$ by orienting every edge between $i$ and a neighbor tow…