We discuss application of the ETH to obtain tight hardness results for a range of hard graph problems such as vertex-partitioning problems.