Combinatorics: Topics, Techniques, Algorithms

Combinatorics: Topics, Techniques, Algorithms

by Peter J. Cameron
     
 

View All Available Formats & Editions

Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a

Overview

Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a constructive or algorithmic proof is more valuable than an existence proof. The book is divided into two parts, the second at a higher level and with a wider range than the first. Historical notes are included which give a wider perspective on the subject. More advanced topics are given as projects and there are a number of exercises, some with solutions given.

Editorial Reviews

From the Publisher
"Cameron covers an impressive amount of material in a relatively small space...an outstanding supplement to other texts..." M. Henle, Choice

"...used as a text at the senior or graduate level and is an excellent reference....The range of topics is very good." The UMAP Journal

Product Details

ISBN-13:
9781107384996
Publisher:
Cambridge University Press
Publication date:
10/06/1994
Sold by:
Barnes & Noble
Format:
NOOK Book
Sales rank:
921,762
File size:
9 MB

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >