Hardness from Densest Subgraph Conjectures