The existence of uniform hypergraphs for which interpolation property of complete coloring fails

Nastaran Haghparast, Morteza Hasanvand, Yumiko Ohno

In 1967 Harary, Hedetniemi, and Prins showed that every graph $G$ admits a complete $t$-coloring for every $t$ with $\chi (G)\le t\le \psi (G)$, where $\chi (G)$ denotes the chromatic number…