Mohr–Pardey–Rautenbach's zero-sum tree-factor conjecture
Mohr–Pardey–Rautenbach's conjecture. Fix integers k,n≥1k,n\geq 1k,n≥1 such that (n2)\binom{n}{2}(2n) and (k−1)n/k(k-1)n/k(k−1)n/k are both even integers. If c:E(Kn)→{−1,1}\mathbf{c}:E(K_n)\to\{-1,1\}c:E(Kn)→{−1,1} is a 0-sum labeling…