1 problem
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 connec…
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 connec…