Let G be a finite group and let r_k(G) be the largest size of a k-progression-free subset. Obtaining sharp bounds for r_k(G) when G is cyclic is a central problem in additive combinatorics, and the case of elementary abelian groups has also been studied extensively. In this talk we discuss the non-commutative setting, and present new bounds valid for every finite group.
