**Notes on Combinatorics**

by Peter J. Cameron

**Publisher**: Queen Mary, University of London 2007**Number of pages**: 130

**Description**:

Contents: Subsets and binomial coefficients; Selections and arrangements; Power series; Recurrence relations; Partitions and permutations; The Principle of Inclusion and Exclusion; Families of sets; Systems of distinct representatives; Latin squares; Steiner triple systems.

Download or read it online for free here:

**Download link**

(440KB, PDF)

## Similar books

**Topics in Algebraic Combinatorics**

by

**Richard P. Stanley**-

**MIT**

Contents: Walks in graphs; Cubes and the Radon transform; Random walks; The Sperner property; Group actions on boolean algebras; Young diagrams and q-binomial coefficients; Enumeration under group action; A glimpse of Young tableaux; etc.

(

**6640**views)

**Combinatorial Algorithms**

by

**Albert Nijenhuis, Herbert S. Wilf**-

**Academic Press Inc**

This is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.

(

**15727**views)

**Foundations of Combinatorics with Applications**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This introduction to combinatorics, the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Some ability to construct proofs is assumed.

(

**8028**views)

**Enumerative Combinatorics: Volume 1**

by

**Richard P. Stanley**-

**MIT**

The standard guide to the topic for students and experts alike. The material in Volume 1 was chosen to cover those parts of enumerative combinatorics of greatest applicability and with the most important connections with other areas of mathematics.

(

**3972**views)