**Applied Combinatorics**

by Mitchel T. Keller, William T. Trotter

**Publisher**: Georgia Institute of Technology 2013**Number of pages**: 345

**Description**:

The purpose of the course is to give students a broad exposure to combinatorial mathematics, using applications to emphasize fundamental concepts and techniques. Our approach to the course is to show students the beauty of combinatorics and how combinatorial problems naturally arise in many settings, particularly in computer science.

Download or read it online for free here:

**Download link**

(multiple formats)

## Similar books

**Combinatorial Theory**

by

**Gian-Carlo Rota**

In 1998, Gian-Carlo Rota gave his famous course at MIT. John N. Guidi took notes in a verbatim manner conveying the substance of the course. Topics covered included sets, relations, enumeration, order, matching, matroids, and geometric probability.

(

**2699**views)

**Combinatorics Through Guided Discovery**

by

**Kenneth P. Bogart**-

**Dartmouth College**

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

(

**5925**views)

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

(

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

(

**3088**views)