Abstract
We consider minimal interval extensions of a partial order which preserve the height of each vertex. We show that minimal interval extensions having this property bijectively correspond to the maximal chains of a sublattice of the lattice of maximal antichains of the given order. We show that they also correspond to the set of minimal interval extensions of a certain extension of this order.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bonnet, R. and Pouzet, M. (1969) Extensions et stratifications d'ensembles dispersés, C. R. Acad. Sci. Paris, A 268, 512–1515.
Felsner, S., Gustedt, J., and Morvan, M. (1999) Interval reductions and extensions of orders: Bijection to chains in lattices, Order 15, 221–246.
Fishburn, P. C. (1985) Interval Orders and Interval Graphs, Wiley.
Habib, M., Morvan, M., Pouzet, M., and Rampon, J.-X. (1991) Extensions intervallaires minimales, C. R. Acad. Sci. Paris I 313, 893–898.
Habib, M., Morvan, M., Pozet, M., and Rampon, J.-X. (1992) Incidence structures, coding and lattice of maximal antichains, Technical Report 92–079, LIRM Montpellier.
Habib, M., Morvan, M., and Rampon J.-X. (1990) Remarks on some concurrency measures, in R. H. Möhring (ed.), Graph Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 484, Springer-Verlag, pp. 221–238.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baldy, P., Morvan, M. Height Preserving Minimal Interval Extensions. Order 18, 69–77 (2001). https://doi.org/10.1023/A:1010737907747
Issue Date:
DOI: https://doi.org/10.1023/A:1010737907747