Ohad Klein: Slicing all edges of an n-cube requires n^{2/3} hyperplaneshttps://www.mathematics.uni-bonn.de/him/video-recordings/tp_2024_03_ws_2_video/workshop-asymptotics-of-random-convex-sets-fluctuations-and-large-deviations/ohad-klein-slicing-all-edges-of-an-n-cube-requires-n-2-3-hyperplaneshttps://www.mathematics.uni-bonn.de/him/++resource++plone-logo.svg
Ohad Klein: Slicing all edges of an n-cube requires n^{2/3} hyperplanes
