On zero-sum spanning trees and zero-sum connectivity

Yair Caro, Adriana Hansberg, Josef Lauri +1

We consider $2$-colourings $f:E(G)\to \{-1,1\}$ of the edges of a graph $G$ with colours $-1$ and $1$ in $\mathbb{Z}$. A subgraph $H$ of $G$ is said to be a zero-sum…