A graph $G$ is called $k$-degenerate if every induced subgraph has a vertex of degree at most $k$. For a graph with $n$ vertices, what is the maximum number of edges?