Wouter Cames van Batenburg

Comparability-Graph Unions Can Have Chromatic Number k^d

For every positive d and k, the authors construct a union of d comparability graphs with clique number k and chromatic number k^d, extending the separation to fractional coloring and the independence ratio.