P. Cameron. Cambridge University Press, Cambridge, NY, (1994)
Abstract
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.
%0 Book
%1 cameron94
%A Cameron, Peter J.
%C Cambridge, NY
%D 1994
%I Cambridge University Press
%K combinatorics inclusion-exclusion textbook
%T Combinatorics: Topics, Techniques, Algorithms
%U http://www.maths.qmul.ac.uk/~pjc/comb/
%X 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.
%@ 0521451337 9780521451338 0521457610 9780521457613
@book{cameron94,
abstract = {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.},
added-at = {2015-11-29T14:05:46.000+0100},
address = {Cambridge, NY},
author = {Cameron, Peter J.},
biburl = {https://www.bibsonomy.org/bibtex/2d5d449eba5381b7df3db407b95aca6b4/ytyoun},
interhash = {db8e417e0d4eb0e0d6f6c2899ce79260},
intrahash = {d5d449eba5381b7df3db407b95aca6b4},
isbn = {0521451337 9780521451338 0521457610 9780521457613},
keywords = {combinatorics inclusion-exclusion textbook},
publisher = {Cambridge University Press},
refid = {29910262},
timestamp = {2015-11-30T07:11:06.000+0100},
title = {Combinatorics: Topics, Techniques, Algorithms},
url = {http://www.maths.qmul.ac.uk/~pjc/comb/},
year = 1994
}