A combinatorial proof of the skew K-saturation theorem

We give a combinatorial proof of the skew version of the K-saturation theorem. More precisely, for any positive integer k$k$, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape kλ/kμ$k\lambda /k\mu$ and type kν$k\nu$, to the set of skew semistandard Young tableaux of shape λ/μ$\lambda /\mu$ and type ν$\nu$.