Combinatorics: Topics, Techniques, Algorithms

Front Cover
Cambridge University Press, Oct 6, 1994 - Mathematics - 355 pages
3 Reviews
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.
 

What people are saying - Write a review

User Review - Flag as inappropriate

nice

Contents

II
1
III
7
IV
21
V
49
VI
75
VII
87
VIII
99
IX
107
XIV
209
XV
225
XVI
245
XVII
257
XVIII
271
XIX
291
XX
307
XXI
325

X
123
XI
147
XII
159
XIII
187
XXII
339
XXIII
343
XXIV
347
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information