We will consider the problem of cutting the maximum number of edges of a cube (commonly known as hypercube in n-dimensions) using a plane (hyperplane in n-dimensions). We will see an explicit plane which gives the maximum cut. Also, we will use a combinatorial lemma (a generalization of Sperner's Lemma) to prove this theorem about geometry.
