Random layerability threshold for set arrays

Determine for which constants d and c almost all (n^d, cn + o(n))-arrays are layerable.

Background

Layerability is stronger than containing one layer: the entire set array must decompose into k layers. The authors ask for the asymptotic parameter range in which this stronger property holds almost surely.

References

Question 15. For which constants d, c are almost all (nd , cn + o(n))-arrays layerable?

Extendibility of Latin Hypercuboids  (2502.08868 - Bowtell et al., 13 Feb 2025) in Question 15, Section 5.4, p. 10