Uniquely colorable hypergraphs

Xizhi Liu, Jie Ma, Tianhen Wang +1

An $r$-uniform hypergraph is uniquely $k$-colorable if there exists exactly one partition of its vertex set into $k$ parts such that every edge contains at most one vertex from eac…