Combinatorics
Topics, Techniques, Algorithms
1st Edition
Published on 6. October 1994
978-1-107-29916-0 (ISBN)
Description
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.
Reviews / Votes
"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 JournalMore details
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
File size
33,00 MB
ISBN-13
978-1-107-29916-0 (9781107299160)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
10/1994
Cambridge University Press
€111.70
Shipment within 15-20 days
Book
10/1994
Cambridge University Press
€61.90
Article exhausted; check for reprint
Content
Preface; 1. What is combinatorics?; 2. On numbers and counting; 3. Subsets, partitions, permutations; 4. Recurrence relations and generating functions; 5. The principle of inclusion and exclusion; 6. Latin squares and SDRs; 7. Extremal set theory; 8. Steiner triple theory; 9. Finite geometry; 10. Ramsey's theorem; 11. Graphs; 12. Posets, lattices and matroids; 13. More on partitions and permutations; 14. Automorphism groups and permutation groups; 15. Enumeration under group action; 16. Designs; 17. Error-correcting codes; 18. Graph colourings; 19. The infinite; 20. Where to from here?; Answers to selected exercises; Bibliography; Index.
