Abstract

Consider a K-uniform hypergraph H = (V, E). A coloring c: V ? {1, 2, ?, k} with k colors is rainbow if every hyperedge e contains at least one vertex from each color, and is called perfectly balanc...

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call