Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
暂无分享,去创建一个
A $k$-uniform hypergraph is said to be $r$-rainbow colorable if there is an $r$-coloring of its vertices such that every hyperedge intersects all $r$ color classes. Given as input such a hypergraph...