Water Transport on 3-Spiders: Unbounded Lengths of Shortest Optimal Strategies

Guanheng Chen, Ran Tao, Tianyi Tao

Let $G$ be a finite simple graph. An averaging operation selects a nonempty connected vertex set and replaces the weights of its vertices by their arithmetic mean. For a nonnegativ…