Roberts F., Tesman B. Applied Combinatorics

2nd Edition. — Taylor and Francis Group, LLC, 2009. — 889 p. — ISBN: 1420099825Now with solutions to selected problems, Applied Combinatorics, Second Edition presents the tools of combinatorics from an applied point of view. This bestselling textbook offers numerous references to the literature of combinatorics and its applications that enable readers to delve more deeply into the topics.
After introducing fundamental counting rules and the tools of graph theory and relations, the authors focus on three basic problems of combinatorics: counting, existence, and optimization problems. They discuss advanced tools for dealing with the counting problem, including generating functions, recurrences, inclusion/exclusion, and Pólya theory. The text then covers combinatorial design, coding theory, and special problems in graph theory. It also illustrates the basic ideas of combinatorial optimization through a study of graphs and networks.What Is Combinatorics
The Basic Tools of Combinatorics
Basic Counting Rules
Introduction to Graph Theory
Relations
The Counting Problem
Generating Functions and Their Applications
Recurrence Relations
The Principle of Inclusion and Exclusion
The Polya Theory of Counting
The Existence Problem
Combinatorial Designs
Coding Theory
Existence Problems in Graph Theory
Combinatorial Optimization
Matching and Covering
Optimization Problems for Graphs and Networks
Appendix: Answers to Selected Exercises