Abstract
Every linear extension L: [x 1<x 2<...<x m ] of an ordered set P on m points arises from the simple algorithm: For each i with 0≤i<m, choose x i+1 as a minimal element of P−{x j :j≤i}. A linear extension is said to be greedy, if we also require that x i+1 covers x i in P whenever possible. The greedy dimension of an ordered set is defined as the minimum number of greedy linear extensions of P whose intersection is P. In this paper, we develop several inequalities bounding the greedy dimension of P as a function of other parameters of P. We show that the greedy dimension of P does not exceed the width of P. If A is an antichain in P and |P−A|≥2, we show that the greedy dimension of P does not exceed |P−A|. As a consequence, the greedy dimension of P does not exceed |P|/2 when |P|≥4. If the width of P−A is n and n≥2, we show that the greedy dimension of P does not exceed n 2+n. If A is the set of minimal elements of P, then this inequality can be strengthened to 2n−1. If A is the set of maximal elements, then the inequality can be further strengthened to n+1. Examples are presented to show that each of these inequalities is best possible.
Similar content being viewed by others
References
V.Bouchitté, M.Habib, and R.Jégou (1985) On the greedy dimension of a partial order, Order 1, 219–224.
R.Dilworth (1950) A decomposition theorem for partially ordered sets, Ann. Math. 51, 161–166.
M. El-Zahar and I. Rival (1985) Greedy linear extensions to minimize jumps, Discrete Appl. Math., to appear.
R. Graham, B. Rothschild, and J. Spencer (1984) Ramsey Theory, Wiley-Interscience.
T.Hiraguchi (1951) On the dimension of partially ordered sets, Sci. Rep. Kanazawa Univ. 1, 77–94.
D.Kelly and W.Trotter (1982) Dimension theory for ordered sets, in Ordered Sets (ed. I.Rival), D. Reidel, Dordrecht, pp. 171–211.
R. Kimble (1973) Extremal problems in dimension theory for partially ordered sets, PhD Thesis, MIT.
W. Pulleyblank (198x) On minimizing setups in precedence constrained scheduling, Discrete Appl. Math., to appear.
I.Rabinovitch (1978) An upper bound on the dimension of interval orders, J. Comb. Theory A25, 68–71.
W.Trotter (1975) Inequalities in dimension theory for posets, Proc. Amer. Math. Soc. 47, 311–316.
W.Trotter (1974) Irreducible posets with arbitrarily large height exist, J. Comb. Theory A17, 337–344.
W.Trotter, J.Moore, and D.Sumner (1976) The dimension of a comparability graph, Proc. Amer. Math. Soc. 60, 35–38.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
Research supported in part by the National Science Foundation under ISP-80110451.
Research supported in part by the National Science Foundation under ISP-80110451 and DMS-8401281.
Rights and permissions
About this article
Cite this article
Kierstead, H.A., Trotter, W.T. Inequalities for the greedy dimensions of ordered sets. Order 2, 145–164 (1985). https://doi.org/10.1007/BF00334853
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00334853