How many hyperplanes does it take to slice all the edges of an \(n\)-dimensional hypercube? Two if you can skim the ends of the edges but more to really slice them. The obvious answer of \(n\) axis-parallel cuts can be improved to \(5n/6\), and Lance Fortnow reports in https://blog.computationalcomplexity.org/2021/03/slicing-hypercube.html that the newest lower bound is \(\Omega(n^{0.57})\), by Gal Yehuda and Amir Yehudayoff, improving their own new preprint https://arxiv.org/abs/2102.05536