The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
Sign Up to like & getrecommendations! Published in 2022 at "Discrete Mathematics"
DOI: 10.1016/j.disc.2021.112722
Abstract: In 1967 Harary, Hedetniemi, and Prins showed that every graph G admits a complete t-coloring for every t with χ(G) ≤ t ≤ ψ(G), where χ(G) denotes the chromatic number of G and ψ(G) denotes… read more here.
Keywords: uniform hypergraphs; complete coloring; interpolation property;