1 problem

Let $G$ be a strongly planar directed acyclic graph, and let $\mathcal L$ be its framing poset. If $x$ and $y$ cover a common element $z$ and there exists a least upper bound…