Young tableaux and k-matchings in finite posets

We present a recursive procedure that directly associates a Young tableau to an arbitrary finite poset with a linear extension, where no a priori information about its Ferrers shape is required.