Solvable and unsolvable instances of the equal sum partition problem

Shlomo Hoory, Dani Kotlar

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k\in \mathbb{N}$ such that $k|{\sum }_{i=1}^{n}i$ and a partition $p_1+\cdots +p_k=n$, when…