On the chromatic number of the union of comparability graphs

Resolving in a strong sense an old problem of Gy\'arf\'as from the 1980s on the union of two perfect graphs, we prove that for every pair of positive integers $d$ and $k$, there is a graph $G$ with clique number $k$ and chromatic number $k^d$ that is the union of $d$ comparability graphs.