Independent sets and repeated degrees Original Research Article

We answer a question of Erdös, Faudree, Reid, Schelp and Staton by showing that for every integer k ⩾ 2 there is a triangle-free graph G of order n such that no degree in G is repeated more than k times and ind(G) = (1 + o(1))n/k.