The third edition of this popular text presents the tools of combinatorics for a first undergraduate course.

Fred S. Roberts is Distinguished Professor, Department of Mathematics, Rutgers University, New Brunswick, NJ; Director Emeritus and Special Advisor of DIMACS, Center for Discrete Mathematics and Theoretical Computer Science; Director of Department of Homeland Security Center of Excellence CCICADA: Command, Control and Interoperability Center for Advanced Data Analysis; Fellow of RUTCOR, Rutgers Center for Operations Research, New Brunswick, NJ.; Member of Graduate Faculties in Mathematics, Operations Research, Computer Science, Computational Molecular Biology, Computational Biology and Molecular Biophysics, Education, and Industrial and Systems Engineering at Rutgers University; Chair, Rutgers University Homeland Security Research Initiative (RUHSRI); Co-Chair, NJ Universities Consortium for Homeland Security Research Barry Tesman is Professor of Mathematics at Dickinson College.

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.