Convex Equipartitions with Extreme Perimeter ★★
Author(s): Nandakumar
To divide a given 2D convex region C into a specified number n of convex pieces all of equal area (perimeters could be different) such that the total perimeter of pieces is (1) maximized (2) minimized.
Remark: It appears maximizing the total perimeter is the easier problem.
Keywords: convex equipartition
Turán Problem for $10$-Cycles in the Hypercube ★★
Author(s): Erdos
Problem Bound the extremal number of in the hypercube.
Keywords: cycles; extremal combinatorics; hypercube
Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube ★★
Problem Determine the smallest percolating set for the -neighbour bootstrap process in the hypercube.
Keywords: bootstrap percolation; extremal combinatorics; hypercube; percolation
Saturation in the Hypercube ★★
Author(s): Morrison; Noel; Scott
Question What is the saturation number of cycles of length in the -dimensional hypercube?
Keywords: cycles; hypercube; minimum saturation; saturation