Connectedness conjecture for least-perimeter disk partitions

Let a minimizing graph be a least-perimeter partition of the unit disk into regions of prescribed areas. Connectedness conjecture. A minimizing graph separates the disk into connected regions. The paper proves the corresponding statement for three regions under the connectedness analysis developed there, while connectedness for general minimizing partitions remains open.