NP-Hardness of Coloring -Colorable -Uniform Hypergraphs with ColorsResearch Paper
A hypergraph coloring assigns a color to each vertex and requires that every edge contain at least two colors. Even when a coloring with two colors exists, finding a coloring with a larger permitted palette can be computationally difficult. For ordinary graphs the two-colorability promise permits an efficient algorithm. For edges of size three, it leads to…