We provide a combinatorial characterization of multiclass PAC learnability in the partial setting with a bounded number of labels. We additionally give bounds for \(\mathcal {M}(\epsilon , \delta )\)  in our more general theorem:partial-pac-learning-sc.
We mention that this result is essentially implied by combining the results of [1]}, [2]} and we state (and prove) it for completeness.
