A Walk Through Combinatiorics (Paperback, 4th)

I. Basic Methods
Chapter 1: Seven Is More Than Six. The Pigeon-Hole Principle
Chapter 2: One Step at a Time. The Method of Mathematical Induction

II. Enumerative Combinatorics
Chapter 3: There Are A Lot Of Them. Elementary Counting Problems
Chapter 4: No Matter How You Slice It. The Binomial Theorem and Related Identities
Chapter 5: Divide and Conquer. Partitions
Chapter 6: Not So Vicious Cycles. Cycles in Permutations
Chapter 7: You Shall Not Overcount. The Sieve
Chapter 8: A Function Is Worth Many Numbers. Generating Functions

III. Graph Theory
Chapter 9: Dots and Lines. The Origins of Graph Theory
Chapter 10: Staying Connected. Trees
Chapter 11: Finding A Good Match. Coloring and Matching
Chapter 12: Do Not Cross. Planar Graphs

IV. Horizons
Chapter 13: Does It Clique? Ramsey Theory
Chapter 14: So Hard To Avoid. Subsequence Conditions on Permutations
Chapter 15: Who Knows What It Looks Like, But It Exists. The Probabilistic Method
Chapter 16: At Least Some Order. Partial Orders and Lattices
Chapter 17: As Evenly As Possible. Block Designs and Error Correcting Codes
Chapter 18: Are They Really Different? Counting Unlabeled Structures
Chapter 19: The Sooner The Better. Combinatorial Algorithms
Chapter 20: Does Many Mean More Than One? Computational Complexity