An introduction to combinatorics

Front Cover
Chapman and Hall, 1991 - Mathematics - 270 pages
By concentrating on counting problems, Introduction to Combinatorics conveys basic ideas of its subject.Topics include combinations, permutations, the inclusion-exclusion principles, partitions, Stirling's Formula, generating functions, recurrence relations, groups, group actions, and graphs. The final two chapters discuss the application of group theory to counting patterns, via Burnside's Theorem and Polya's Theorem.Slomson's approach is to begin with concrete problems, and to use them as a lead-in to general theory.Numerous exercises-most of which are provided with detailed answers-are included for the advanced student. Among the applications considered are approaches to probability problems, especially in card games.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Permutations and combinations
The inclusionexclusion principle

10 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information