Combinatorics is mathematics of enumeration, existence, construction, and optimization questions concerning finite sets. This text focuses on the first three types of questions and covers basic counting and existence principles, distributions, generating functions, recurrence relations, Pólya theory, combinatorial designs, error correcting codes, partially ordered sets, and selected applications to graph theory including the enumeration of trees, the chromatic polynomial, and introductory Ramsey theory. The only prerequisites are single-variable calculus and familiarity with sets and basic proof techniques. It is flexible enough to be used for undergraduate courses in combinatorics, second courses in discrete mathematics, introductory graduate courses in applied mathematics programs, as well as for independent study or reading courses. It also features approximately 350 reading questions spread throughout its eight chapters. These questions provide checkpoints for learning and prepare the reader for the end-of-section exercises of which there are over 470.Read more
- Flexible enough to be used for undergraduate courses in combinatorics, second courses in discrete mathematics, introductory graduate courses in applied mathematics programs, as well as for independent study or reading courses
- 350 reading questions are spread through the chapters, providing checkpoints for learning to prepare the reader for the end-of-section exercises
- Travel notes enrich the material of each section with anecdotes, open problems, suggestions for further reading and biographical information about mathematicians involved in the discoveries
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: March 2010
- format: Hardback
- isbn: 9780883857625
- length: 410 pages
- dimensions: 261 x 182 x 26 mm
- weight: 0.87kg
- contains: 51 b/w illus.
- availability: Temporarily unavailable - available from TBC
Table of Contents
Before you go
Part I. Principles of Combinatorics:
1. Typical counting questions, the product principle
2. Counting, overcounting, the sum principle
3. Functions and the bijection principle
4. Relations and the equivalence principle
5. Existence and the pigeonhole principle
Part II. Distributions and Combinatorial Proofs:
6. Counting functions
7. Counting subsets and multisets
8. Counting set partitions
9. Counting integer partitions
Part III. Algebraic Tools:
11. Mathematical induction
12. Using generating functions, part I
13. Using generating functions, part II
14. techniques for solving recurrence relations
15. Solving linear recurrence relations
Part IV. Famous Number Families:
16. Binomial and multinomial coefficients
17. Fibonacci and Lucas numbers
18. Stirling numbers
19. Integer partition numbers
Part V. Counting Under Equivalence:
20. Two examples
21. Permutation groups
22. Orbits and fixed point sets
23. Using the CFB theorem
24. Proving the CFB theorem
25. The cycle index and Pólya's theorem
Part VI. Combinatorics on Graphs:
26. Basic graph theory
27. Counting trees
28. Colouring and the chromatic polynomial
29. Ramsey theory
Part VII. Designs and Codes:
30. Construction methods for designs
31. The incidence matrix, symmetric designs
32. Fisher's inequality, Steiner systems
33. Perfect binary codes
34. Codes from designs, designs from codes
Part VIII. Partially Ordered Sets:
35. Poset examples and vocabulary
36. Isomorphism and Sperner's theorem
37. Dilworth's theorem
39. Möbius inversion, part I
40. Möbius inversion, part II
Hints and answers to selected exercises.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact firstname.lastname@example.org.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
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.×