  We define a graded graph, called the Schur--Weyl graph, which arises
naturally when one considers simultaneously the RSK algorithm and the classical
duality between representations of the symmetric and general linear groups. As
one of the first applications of this graph, we give a new proof of the
completeness of the list of discrete indecomposable characters of the infinite
symmetric group.
