Other available formats:
Request inspection copy
Lecturers may request a copy of this title for inspection
This long-awaited textbook is the most comprehensive introduction to a broad swath of combinatorial and discrete mathematics. The text covers enumeration, graphs, sets, and methods, and it includes both classical results and more recent developments. Assuming no prior exposure to combinatorics, it explains the basic material for graduate-level students in mathematics and computer science. Optional more advanced material also makes it valuable as a research reference. Suitable for a one-year course or a one-semester introduction, this textbook prepares students to move on to more advanced material. It is organized to emphasize connections among the topics, and facilitate instruction, self-study, and research, with more than 2200 exercises (many accompanied by hints) at various levels of difficulty. Consistent notation and terminology are used throughout, allowing for a discussion of diverse topics in a unified language. The thorough bibliography, containing thousands of citations, makes this a valuable source for students and researchers alike.Read more
- Can be used as a text for a one-year sequence, or as a one-semester introduction leading to an advanced course, with a complete solutions manual available online for instructors
- Contains more than 2200 exercises at various levels. Especially instructive, interesting, or valuable exercises are marked with a diamond symbol
- Includes several thousand references (with pointers to pages where cited) and many exercises, theorems, and proofs that have not previously appeared in textbooks
Reviews & endorsements
'This is a great book by a great writer. It covers the main topics of combinatorics, is well written and presents many beautiful ideas and techniques. It is very helpful to students, teachers and researchers. I would like to have this book on my desk.' Alexandr Kostochka, University of IllinoisSee more reviews
'This is a real gem, capturing the spirit, breadth and depth of combinatorics. Doug West is a master of exposition, his thorough treatment of the subject will be useful for students and researchers in mathematics and computer science.' Noga Alon, Princeton University, New Jersey
'A comprehensive and comprehensible treatment of combinatorial mathematics - what the author intended, and more - a valuable resource on the subject. It may well stimulate the addition to the university curriculum of courses in this area. Borrowing advice from the past, my recommendation for anyone wanting a definitive book on combinatorics is 'Go West, my friend, go West!'' Lowell Beineke, Purdue University Fort Wayne
'I have taught out of this book for many years. It is the ideal textbook for graduate students or advanced undergraduates. The book is filled with lots of great problems that are well suited for homework assignments and potential research projects. Highly recommended.' Arthur Benjamin, Harvey Mudd College, California
'This book is impressive both for its breadth and its hundreds of exercises. Serious study of it will richly reward the reader.' Daniel Cranston, Virginia Commonwealth University
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: July 2020
- format: Hardback
- isbn: 9781107058583
- length: 988 pages
- dimensions: 252 x 198 x 57 mm
- weight: 2kg
- contains: 2200 exercises
- availability: In stock
Table of Contents
Part I. Enumeration:
1. Combinatorial arguments
2. Recurrence relations
3. Generating functions
4. Further topics
Part II. Graphs:
5. First concepts for graphs
7. Connectivity and cycles
9. Planar graphs
Part III. Sets:
10. Ramsey theory
11. Extremal problems
12. Partially ordered sets
13. Combinatorial designs
Part IV. Methods:
14. The probabilistic method
15. Linear algebra
16. Geometry and topology
Appendix. Hints 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.×