Abstract
Under the general term “combinatorial order theory” we want to collect some results on posets by concentrating less on the structure of posets than on properties present in any poset, such as chains, antichains, matchings, etc. Typical problems to be considered are the determination of the minimal number of chains into which a finite poset can be decomposed or the existence of a matching between the points and copoints of a ranked poset. In fact, the importance of this branch of combinatorial mathematics derives to a large extent from the fact that most of the main results are existence theorems supplementing the many counting results established in chapters III to V. To testify to the broad range of applications, we have included a variety of examples from different sources (graphs, networks, 0,1-matrices, etc.). Each of the sections is headed by a basic theorem after which we study variations of the main theorem, applications, and the mutual dependence with other results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
Hall, P.: On representatives of subsets. J. London Math. Soc. 10, 26–30 (1935).
Rado, R.: A theorem on independence relations. Quart. J. Math. (Oxford) 13, 83–89 (1942).
Rado, R.: Axiomatic treatment of rank in infinite sets. Can. J. Math. 1, 337–343 (1949).
Mirsky, L.-Perfect, H.: Systems of representatives. J. Math. Anal. Appl. 15, 520–568 (1966).
Mirsky, L.-Perfect, H.: Applications of the notion of independence to combinatorial analysis. J. Comb. Theory 2, 327–357 (1967).
Mirsky, L.-Perfect, H.: Systems of representatives. J. Math. Anal. Appl. 15, 520–568 (1966).
Harper, L. H.-Rota, G. C.: Matching theory: an introduction. Advances in Probability 1, 169–213. New York: Decker (1971).
Harary, F.-Prins, G.: The number of homeomorphically irreducible trees, and other species. Acta Math. 101, 141–162 (1959).
Schützenberger, M. P.: Contributions aux applications statistiques de la théorie de l’information. Publ. Inst. Stat. Univ. Paris 3, 5–117 (1954).
Katona, G.: Sperner Type Theorems. Dept. Stat. Univ. North Carolina Mimeo Series 600.17 (1969).
Katona, G.: Extremal problems for hypergraphs. Combinatorics (Hall-Van Lint, eds.). Math. Centre Tracts 56, 13–42. Amsterdam (1974).
Ramsey, F. P.: On a problem of formal logic. Proc. London Math. Soc. (2) 30, 264–286 (1930).
Koch, J. See Appel-Haken-Koch. König, D.: Theorie der Endlichen und Unendlichen Graphen. Leipzig (1936). Reprinted New York: Chelsea (1950).
Graham, R. L.-Rothschild, B. L.: A survey of finite Ramsey theorems. Proc. 2nd Louisiana Conf. Comb. Graph Th. and Comp., 21–41. Louisiana State Univ. (1971).
Graham, R. L.-Rothschild, B. L.: Some recent developments in Ramsey theory. Combinatorics (Hall-VanLint, eds.). Math. Centre Tracts 56, 61–76. Amsterdam (1974).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Aigner, M. (1979). Combinatorial Order Theory. In: Combinatorial Theory. Grundlehren der mathematischen Wissenschaften, vol 234. Springer, New York, NY. https://doi.org/10.1007/978-1-4615-6666-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6666-3_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4615-6668-7
Online ISBN: 978-1-4615-6666-3
eBook Packages: Springer Book Archive