Abstract
For a finite poset P and x, yεP let pr(x>y) be the fraction of linear extensions which put x above y. N. Linial has shown that for posets of width 2 there is always a pair x, y with 1/3 ⩽ pr(x>y)⩽2/3. The disjoint union C 1∪C 2 of a 1-element chain with a 2-element chain shows that the bound 1/3 cannot be further increased. In this paper the extreme case is characterized: If P is a poset of width 2 then the bound 1/3 is exact iff P is an ordinal sum of C 1∪C 2's and C 1's.
Similar content being viewed by others
References
P. C.Fishburn (1984) A correlational inequality for linear extensions of a poset, Order 1, 127–137.
M.Fredman (1976) How good is the information theory bound in sorting? Theor. Comp. Sci. 1, 355–361.
R. L.Graham (1981) Linear extensions of partial orders and the FKG inequality, in Ordered Sets (I.Rival, ed.), D. Reidel, Dordrecht, pp. 213–236.
J.Kahn and M.Saks (1984) Balancing poset extensions, Order, 1, 113–126.
N.Linial (1984) The information-theoretic bound is good for merging, SIAM J. Comp. 13, 795–801.
N.Linial and M.Saks (1985) Searching ordered structures, J. Algor. 6, 86–103.
L. A.Shepp (1982) The XYZ conjecture and the FKG inequality, Ann. Prob. 10, 824–827.
P. M.Winkler (1983) Correlation among partial orders, SIAM J. Alg. Disc. Math. 4, 1–7.
Author information
Authors and Affiliations
Additional information
Communicated by P. Hell
Rights and permissions
About this article
Cite this article
Aigner, M. A note on merging. Order 2, 257–264 (1985). https://doi.org/10.1007/BF00333131
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00333131