Chapter 1: What Is Combinatorics? THE BASIC TOOLS OF COMBINATORICS
Chapter 2: Basic Counting Rules;
Chapter 3: Introduction to Graph Theory;
Chapter 4 Relations; THE COUNTING PROBLEM
Chapter 5: Generating Functions and Their Applications;
Chapter 6: Recurrence Relations;
Chapter 7: The Principle of Inclusion and Exclusion;
Chapter 8: The Pólya Theory of Counting; THE EXISTENCE PROBLEM
Chapter 9: Combinatorial Designs;
Chapter 10: Coding Theory;
Chapter 11: Existence Problems in Graph Theory; COMBINATORIAL OPTIMIZATION
Chapter 12: Matching and Covering;
Chapter 13: Optimization Problems for Graphs and Networks; Appendix: Answers to Selected Exercises; Author Index; Subject Index; References appear at the end of each chapter.
Biography
Fred S. Roberts is professor of mathematics and director of DIMACS at Rutgers University.
Barry Tesman is a professor of mathematics at Dickinson College.






