2 problems

Let $n\geq2$, let $\rho\in[-1,1]$, and let $3\leq k\leq n+1$. Let $\{A_i\}_{i=1}^k$ be a measurable partition of $\mathbb{R}^n$, meaning that $\bigcup_{i=1}^k A_i=\mathbb{R}^n$ and…

MAX-$k$-CUT analogue. An analogue of the relevant MAX-CUT theorem should hold for MAX-$k$-CUT.