A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Some remarks on normalized matching
1983
Journal of combinatorial theory. Series A
A new class of LYM orders is obtained, and several results about general LYM orders are proved. (1) Let A, CA, c ... CA,. be a chain of subsets of [n]= (1,..., n}. Let (a,) and (bj) be two nondecreasing sequences with ai < b, for 1 <i< r. Then (XC [n]: ai < lXnA,l <b,}, ordered by inclusion, is a poset having the LYM property. (2) The smallest regular covering of an LYM order has M(P) chains, where M(P) is the least common multiple of the rank sizes. (3) Every LYM order has a smallest regular
doi:10.1016/0097-3165(83)90015-8
fatcat:dkvc62tkc5dnxblxeptopecdl4