Question: Is there an algorithm which will perform migration in
strictly less than $3/2\Delta$ steps for any demand graph $G$ with at
least $6$ nodes and maximum degree $\Delta \geq 6$?

