• Title Foundations of Combinatorics with Applications
• Author(s) Edward A. Bender and S. Gill Williamson
• Publisher: Dover Publications (February 6, 2006)
• Paperback 480 pages
• eBook PDF and PostScript
• Language: English
• ISBN-10: 0486446034
• ISBN-13: 978-0486446035
• Share This:  

Book Description

This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.

The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion, sorting theory, and rooted plane trees. The final section, on generating functions, offers students a powerful tool for studying counting problems. Numerous exercises appear throughout the text, along with notes and references.

The text concludes with solutions to odd-numbered exercises and to all appendix exercises.

• Edward A. Bender is a Professor Emeritus of Mathematics at University of California, San Diego. He received his Ph.D. in Mathematics at California Institute of Technology in 1966.

• Amazon

• Combinatorics and Game Theory
• Graph Theory
• Discrete and Finite Mathematics
• Algorithms and Data Structures

• Foundations of Combinatorics with Applications (Edward A. Bender, et al)
• The Mirror Site (1) - PDF - Download Only

• Lists, Decisions and Graphs - With an Introduction to Probability (Edward A. Bender, et al)
• Applied Combinatorics (Mitchel T. Keller, et al)
• Combinatorics Through Guided Discovery (Kenneth P. Bogart)
• Analytic Combinatorics (Philippe Flajolet and Robert Sedgewick)