Complexity of Partitioning Hypergraphs

Seonghyuk Im

For a given $\pi =({\pi }_0,{\pi }_1,...,{\pi }_k)\in \{0,1,\ast {\}}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V,E)$ has a partition $(V_1,V_2)$ of the vertex set so…