Question 100
The vertices of a cube are labeled with the integers $1$ through $8$, with each used exactly once. Let $s$ be the maximum sum of the labels of two edge-adjacent vertices. Compute the minimum possible value of $s$ over all such labelings.