A walk through combinatorics: an introduction to enumeration and graph theory
Miklós Bóna · Choice Reviews Online · 2007
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 The Sooner The Better. Combinatorial Algorithms Does Many Mean More Than One? Computational Complexity.