The New Palgrave Dictionary of Economics

2018 Edition
| Editors: Macmillan Publishers Ltd

Combinatorics

  • A. P. Kirman
Reference work entry
DOI: https://doi.org/10.1057/978-1-349-95189-5_58

Abstract

Combinatorics, or combinatorial mathematics, is a difficult field to define. It cuts across many branches of mathematics yet a mathematician will clearly sense which problems are of a combinatorial nature. Perhaps the simplest definition is that it is concerned with configurations or arrangements of elements, usually finite in number, into sets. Three basic types of problem are posed. Firstly the existence of certain configurations; secondly, once their existence is proved, the classification or enumeration of the configurations meeting the requirements imposed; and thirdly the construction of algorithms for finding the configurations in question.

This is a preview of subscription content, log in to check access.

References

  1. There elegant and elementary introductions to combinatorics are Berge (1971), Polya, Tarjan and Woods (1983) and Ryser (1963). A more advanced text is Aigner (1979).Google Scholar
  2. Aigner, M. 1979. Combinatorial theory. Berlin: Springer.CrossRefGoogle Scholar
  3. Berge, C. 1971. Principles of combinatorics. New York: Academic.Google Scholar
  4. Polya, G., R.E. Tarjan, and D.R. Woods. 1983. Notes on introductory combinatorics. Boston: Birkhauser.CrossRefGoogle Scholar
  5. Ryser, H.J. 1963. Combinatorial mathematics, Mathematical Association of America. New York: Wiley.Google Scholar

Copyright information

© Macmillan Publishers Ltd. 2018

Authors and Affiliations

  • A. P. Kirman
    • 1
  1. 1.