On (almost) extreme components in Kronecker products of characters of   the symmetric groups
  Using a recursion formula due to Dvir, we obtain information on maximal and almost maximal components in Kronecker products of characters of the symmetric groups. This is applied to confirm a conjecture made by Bessenrodt and Kleshchev in 1999, which classifies all such Kronecker products with only three or four components. 
Christine Bessenrodt and Stephanie van Willigenburg
math.CO math.RT