Applied Combinatorics, Second Edition

Now 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. Content: Cover Title Copyright Contents Preface Notation Chapter 1: What Is Combinatorics? PART I: The Basic Tools of Combinatorics Chapter 2: Basic Counting Rules Chapter 3: Introduction to Graph Theory Chapter 4: Relations PART II: 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 Polya Theory of Counting PART III: The Existence Problem Chapter 9: Combinatorial Designs Chapter 10: Coding Theory Chapter 11: Existence Problems in Graph Theory. PART IV: Combinatorial OptimizationChapter 12: Matching and Covering Chapter 13: Optimization Problems for Graphs and Networks Appendix: Answers to Selected Exercises Author Index Subject Index. The book has been substantially rewritten with more than 200 pages of new materials and many changes in the exercises. There are also many new examples to reflect the new developments in computer science and biology since 1990. ... Many important topics are covered and they are done in detail. This book is one of the rare ones that does the job really well. ... I strongly endorse this book. It is suitable for motivated math, computer science or engineering sophomores and even beginning graduate students. In fact bright high school students would love this book and if they are exposed early (throug "The second edition of Applied Combinatorics comes 20 years after the first one. It has been substantially rewritten with more than 200 pages of new material and significant changes in numerous sections. There are many new examples and exercises. On the other hand, the main philosophy of the book is unchanged. The following three paragraphs are from the preface of the first edition and these words still ring true today

Now 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

Presents the tools of combinatorics from an applied point of view. This book focuses on three basic problems of combinatorics: counting, existence, and optimization problems. It contains many examples from the biological, computer, and social sciences, including disease screening, genome mapping, satellite communication and search engines.