**Combinatorics Through Guided Discovery**

by Kenneth P. Bogart

**Publisher**: Dartmouth College 2004**Number of pages**: 202

**Description**:

This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'. The book consists almost entirely of problems.

Download or read it online for free here:

**Download link**

(1.2MB, PDF)

## Similar books

**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.

(

**2370**views)

**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.

(

**5324**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.

(

**13686**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.

(

**6303**views)