Combinatorics
Topics, Techniques, Algorithms
£57.99
- Author: Peter J. Cameron
- Date Published: October 1994
- availability: Available
- format: Paperback
- isbn: 9780521457613
-
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.
Read more- Written in two parts at different levels
- Includes projects for brighter students
- Features historical notes which add perspective
- Incorporates numerous exercises
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: October 1994
- format: Paperback
- isbn: 9780521457613
- length: 368 pages
- dimensions: 234 x 191 x 25 mm
- weight: 0.649kg
- availability: Available
Table of Contents
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.
Related Books
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×