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

**An Introduction to Combinatorics and Graph Theory**

by

**David Guichard**-

**Whitman College**

The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.

(

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

(

**1735**views)

**Analytic Combinatorics**

by

**Philippe Flajolet, Robert Sedgewick**-

**Cambridge University Press**

Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.

(

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

(

**12651**views)