Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
Reducibility Among Combinatorial Problems