Combinatorics: Topics, Techniques, Algorithms

by Peter J. Cameron

Combinatorics is a subject of increasing importance because of its links with computer science, statistics, and algebra. This textbook stresses common techniques (such as generating functions and recursive construction) that underlie the great variety of subject matter, and the fact that a constructive or algorithmic proof is more valuable than an existence proof. The author emphasizes techniques as well as topics and includes many algorithms described in simple terms. The text should provide essential background for students in all parts of discrete mathematics.

Genres: Mathematics, Computer Science, Science, Nonfiction, Textbooks

368 pages, Paperback

First published August 1, 1994

Reviews

[Ayush Bhat · Rating 5 out of 5]

This book puts the Twelve-fold way in the Combinatorics in set theoretic prescriptive which makes it easier to model in the mind.

[Jeremy · Rating 4 out of 5]

The main arguments in Combinatorics are that combinatorial techniques can be used to solve any problem, and that problem solving is an art as much as a science. The book also explores the various applications of combinatorial techniques, such as cryptography and optimization.

[Kelvin Poon · Rating 4 out of 5]

Excellent