Abstract
We introduce the notion of a partially ordered set (poset) we and define several types of special elements associated with partial orders.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
B. Dushnik, E.W. Miller, Partially ordered sets. Am. J. Math. 63, 600–610 (1941)
W.M. Trotter, Combinatorics and Partially Ordered Sets (The Johns Hopkins University Press, Baltimore, 1992)
W.T. Trotter, Partially ordered sets, in Handbook of Combinatorics, ed. by R.L. Graham, M. Grötschel, L. Lovász (The MIT Press, Cambridge, 1995), pp. 433–480
R.P. Stanley, Enumerative Combinatorics, vol. 1 (Cambridge University Press, Cambridge, 1997)
J.H. van Lint, R.M. Wilson, A Course in Combinatorics (Cambridge University Press, Cambridge, second edition, 2002)
M. Barbut, B. Montjardet, Ordre ar Classification - Algèbre et Combinatoire (Hachette Université, Paris, 1970)
N. Caspard, B. Leclerc, B. Montjardet, Finite Ordered Sets (Cambridge University Press, Cambridge, 2012)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Simovici, D.A., Djeraba, C. (2014). Partially Ordered Sets. In: Mathematical Tools for Data Mining. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-4471-6407-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6407-4_2
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6406-7
Online ISBN: 978-1-4471-6407-4
eBook Packages: Computer ScienceComputer Science (R0)