Before revision: We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs , for any constant d>2, unless ETH fails.
After revision: We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs unless ETH fails.