1 problem

Let $P$ be a connected $d$-complete poset with maximum element $v_0$, rank function $r:P\to\mathbb{N}$, top tree $T$, and $d$-complete coloring $c:P\to T$. For a $P$-partition…