Jong‐Gul Yoon

Small Rotation Blocks and the Order-Six Stable Marriage Problem

We prove that a finite poset with at most fifteen elements, width at most three, and the following common-incomparability property has at most 48 antichains: for every x < y, the elements incomparable with both x and y form a chain of size at most two. An explicit fifteen-element...

Small Rotation Blocks and the Order-Six Stable Marriage Problem

We prove that a finite poset with at most fifteen elements, width at most three, and the following common-incomparability property has at most 48 antichains: for every x < y, the elements incomparable with both x and y form a chain of size at most two. An explicit fifteen-element...