They can. As Francesco mentioned, these problems can be solved with less correspondences. What makes the difference is how we formulate the problem.
If we like a fast linear solution, then 8-points are required. For formulations using less number of points, the constraints are non-linear and typically involve either determinants or systems of polynomial equations that are solved with some form of Gröbner basis methods. These methods are typically known under the name minimal problems in computer vision and are investigated heavily by Zuzana Kukelova. For a set of related problems and proposed solutions refer to the website: http://aag.ciirc.cvut.cz/minimal/.
For the particular case of 8-point algorithm: In the 8-point algorithm we solve (in a linear fashion) for the elements of a matrix that is not necessarily a fundamental/essential matrix. In a subsequent step, we then project this matrix onto the manifold of essential matrices. This is how we obtain the end result. That stage ensures two non-linear constraints:
$$
\begin{align}
\det\mathbf{E} &= 0\\
2\mathbf{E}\mathbf{E}^{\top}\mathbf{E}-\text{tr}(\mathbf{E}\mathbf{E}^{\top})\mathbf{E} &= 0
\end{align}
$$
So not every matrix is an essential matrix and we cannot simply have $0$s for certain terms.
You see here that the solution to the initial linear system is subject to a different constraint which can yield a linear system. If we like to bake the actual non-linear constraints in, we can reduce the number of points to 5 (for essential) at the cost of increased complexity.