On the chromatic number of the union of comparability graphs
Abstract
Resolving in a strong sense an old problem of Gyárfás 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 kd that is the union of d comparability graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.