System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.
Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.
The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity.
As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.
The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.
Sample Chapter(s)
Chapter 1: Seven Is More Than Six. The Pigeon-Hole Principle (181 KB)
Chapter 4: No Matter How You Slice It. The Binomial Theorem and Related Identities (228 KB)
Chapter 15: Who Knows What It Looks Like,But It Exists. The Probabilistic Method (286 KB)
Contents:
- Basic Methods:
- Seven is More Than Six. The Pigeon-Hole Principle
- One Step at a Time. The Method of Mathematical Induction
- Enumerative Combinatorics:
- There are a Lot of Them. Elementary Counting Problems
- No Matter How You Slice It. The Binomial Theorem and Related Identities
- Divide and Conquer. Partitions
- Not So Vicious Cycles. Cycles in Permutations
- You Shall Not Overcount. The Sieve
- A Function is Worth Many Numbers. Generating Functions
- Graph Theory:
- Dots and Lines. The Origins of Graph Theory
- Staying Connected. Trees
- Finding a Good Match. Coloring and Matching
- Do Not Cross. Planar Graphs
- Horizons:
- Does It clique? Ramsey Theory
- So Hard to Avoid. Subsequence Conditions on Permutations
- Who Knows What It Looks Like, But It Exists. The Probabilistic Method
- At Least Some Order. Partial Orders and Lattices
- As Evenly as Possible. Block Designs and Error Correcting Codes
- Are They Really Different? Counting Unlabeled Structures
- The Sooner the Better. Combinatorial Algorithms
- Does Many Mean More Than One? Computational Complexity
