Given an integer k ≧ 2 and a real number γ ∈ [0; 1], which graphs of edge density γ contain the largest number of k-edge stars? For k = 2 Ahlswede and Katona proved that asymptotically there cannot be more such stars than in a clique or in the complement of a clique (depending on the value of γ). Here we extend their result to all integers k ≧ 2.