Combinatorial Order Theory

  • Martin Aigner
Part of the Grundlehren der mathematischen Wissenschaften book series (GL, volume 234)


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.


Bipartite Graph Rank Function Maximal Chain Ramsey Number Transversal Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hall, P.: On representatives of subsets. J. London Math. Soc. 10, 26–30 (1935).CrossRefGoogle Scholar
  2. 1.
    Rado, R.: A theorem on independence relations. Quart. J. Math. (Oxford) 13, 83–89 (1942).MathSciNetGoogle Scholar
  3. 2.
    Rado, R.: Axiomatic treatment of rank in infinite sets. Can. J. Math. 1, 337–343 (1949).MathSciNetzbMATHCrossRefGoogle Scholar
  4. 1.
    Mirsky, L.-Perfect, H.: Systems of representatives. J. Math. Anal. Appl. 15, 520–568 (1966).Google Scholar
  5. 2.
    Mirsky, L.-Perfect, H.: Applications of the notion of independence to combinatorial analysis. J. Comb. Theory 2, 327–357 (1967).Google Scholar
  6. 1.
    Mirsky, L.-Perfect, H.: Systems of representatives. J. Math. Anal. Appl. 15, 520–568 (1966).Google Scholar
  7. 1.
    Harper, L. H.-Rota, G. C.: Matching theory: an introduction. Advances in Probability 1, 169–213. New York: Decker (1971).Google Scholar
  8. 1.
    Harary, F.-Prins, G.: The number of homeomorphically irreducible trees, and other species. Acta Math. 101, 141–162 (1959).Google Scholar
  9. 1.
    Schützenberger, M. P.: Contributions aux applications statistiques de la théorie de l’information. Publ. Inst. Stat. Univ. Paris 3, 5–117 (1954).Google Scholar
  10. 2.
    Katona, G.: Sperner Type Theorems. Dept. Stat. Univ. North Carolina Mimeo Series 600.17 (1969).Google Scholar
  11. 5.
    Katona, G.: Extremal problems for hypergraphs. Combinatorics (Hall-Van Lint, eds.). Math. Centre Tracts 56, 13–42. Amsterdam (1974).Google Scholar
  12. 1.
    Ramsey, F. P.: On a problem of formal logic. Proc. London Math. Soc. (2) 30, 264–286 (1930).CrossRefGoogle Scholar
  13. 1.
    Koch, J. See Appel-Haken-Koch. König, D.: Theorie der Endlichen und Unendlichen Graphen. Leipzig (1936). Reprinted New York: Chelsea (1950).Google Scholar
  14. 1.
    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).Google Scholar
  15. 3.
    Graham, R. L.-Rothschild, B. L.: Some recent developments in Ramsey theory. Combinatorics (Hall-VanLint, eds.). Math. Centre Tracts 56, 61–76. Amsterdam (1974).Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1979

Authors and Affiliations

  • Martin Aigner
    • 1
  1. 1.II. Institut für MathematikFreie Universität BerlinBerlin 33Federal Republic of Germany

Personalised recommendations