Foundations of Applied Combinatorics [Hardcover]

Edward A. Bender (Author)

Book Description

Publication Date: January 1991 | ISBN-10: 0201510391 | ISBN-13: 978-0201510393

This introduction to combinatorics is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Covers basic counting, functions, decision trees, and sieving methods; fundamental concepts in graph theory and a sampler of graph topics; induction and recursion, sorting theory, and rooted plane trees. Numerous exercises (some with solutions), notes, and references. Includes 75 figures. Appendixes.

--This text refers to the Paperback edition.

Product Details

• Hardcover: 425 pages
• Publisher: Addison-Wesley (January 1991)
• Language: English
• ISBN-10: 0201510391
• ISBN-13: 978-0201510393
• Product Dimensions: 9.4 x 6.2 x 1.1 inches
• Shipping Weight: 1.8 pounds
• Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #4,359,028 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

4.0 out of 5 stars A catalog of nearly all of discrete math / combinatorics, December 23, 2011

By 

Scott (Dubuque, IA) - See all my reviews

Amazon Verified Purchase

This review is from: Foundations of Combinatorics with Applications (Dover Books on Mathematics) (Paperback)

I have not yet read in this Dover book, of which I have two copies. In 2009 I did read all of the sophomore-level A Short Course in Discrete Mathematics (Dover Books on Computer Science) by the same two authors of Bender and Williamson, and really like their rather computational writing style. They are both emerita at U. California San Diego (UCSD). This 468 page and 6.5"x9.25" book is their first year graduate level and much more comprehensive version of discrete mathematics. Even at its large page size, the font size is still quite small, a real problem with many books reprinted by Dover.

Since there is no Amazon 'Look Inside' utility for this book, here is the GENERAL TABLE OF CONTENTS:

Contents / Preface / PART I: Counting and Listing / 1 Basic Counting / 2 Functions / 3 Decision Trees / 4 Sieving Methods / PART II: Graphs / 5 Basic Concepts in Graph Theory / 6 A Sampler of Graph Topics / PART III: Recursion / 7 Induction and Recursion / 8 Sorting Theory / 9 Rooted Plane Trees / PART IV: Generating Functions / 10 Ordinary Generating Functions / *11 Generating Function Topics / Appendix A: Induction / Appendix B: Rates of Growth and the Analysis of Algorithms / Appendix C: Basic Probability / Appendix D: Partial Fractions / Solutions to Odd Exercises and Most Appendix Exercises / Index

The reason I called this book a 'catalog' in my title is because, at well over 400 pages of actual subject coverage over that big table of contents above, there isn't a whole lot of combinatorics missing from this book.