... µ, ν of n we obtain a lower bound onn, depending onλ, µ, ν, for the stability of the multiplicity c(λ, µ, ν )of νin χλ⊗ χµ.Ourproof is purely combinatorial. It uses a description of the ... the set of partitions of n together with the dominance order, see [1, 3, 5, 7].Let H be a subgroup of a group G.Ifχis a character of H we denote by IndGH(χ)the induction character of χ. For ... µ, ν of n we denote byc(λ, µ, ν):=χλ⊗χµ,χν (1)the multiplicity of χνin the Kronecker product χλ⊗ χµ.F. Murnaghan observed in [6] that the computation of the decompositon of the...