The least-perimeter partition of a sphere into four equal areas (Q603841)

The paper deals with the least-perimeter partition of the sphere into four regions of equal area. Under the assumption that each region is convex \textit{L. Fejes Tóth} solved the problem [Regular figures. International Series of Monographs on Pure and Applied Mathematics. 47. Oxford etc.: Pergamon Press. VIII, 339 p. (1964; Zbl 0134.15705)]. But in principle each region may have many components. The author proves that the least perimeter partition is the tetrahedral partition in the general case, too.