Applied Combinatorics
Alan Tucker(Author)
Wiley (Publisher)
5th Edition
Published on 1. November 2006
Book
Hardback
496 pages
978-0-471-73507-6 (ISBN)
Article exhausted; check for reprint
Description
Updated with new material, this Fifth Edition of the most widely used book in combinatorial problems explains how to reason and model combinatorically. It also stresses the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity. Combinatorical reasoning underlies all analysis of computer systems. It plays a similar role in discrete operations research problems and in finite probability. This book seeks to develop proficiency in basic discrete math problem solving in the way that a calculus text develops proficiency in basic analysis problem solving.
Reviews / Votes
"...a well-structured text that addresses a broad range of topics... It is well presented...and easy to follow." (Times Higher Education Supplement, November 2007)More details
Edition
5th Revised edition
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
Professional and scholarly
Edition type
Revised edition
Illustrations
Illustrations
Dimensions
Height: 237 mm
Width: 162 mm
Thickness: 22 mm
Weight
680 gr
ISBN-13
978-0-471-73507-6 (9780471735076)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions

Person
Alan Tucker is Deputy Department Chair and Undergraduate Program Director in the Department of Applied Mathematics and Statistics at SUNY Stony Brook.
Content
Prelude. PART ONE: GRAPH THEORY. Chapter 1. Elements of Graph Theory. Chapter 2. Covering Circuits and Graph Coloring. Chapter 3. Trees and Searching. Chapter 4. Network Algorithms. PART TWO: ENUMERATION. Chapter 5. General Counting Methods for Arrangements and Selections. Chapter 6. Generating Functions. Chapter 7. Recurrence Relations. Chapter 8. Inclusion-Exclusion. PART THREE: ADDITIONAL TOPICS. Chapter 9. Polya's Enumeration Formula. Chapter 10. Computer Science Approaches to Enumeration. Chapter 11. Games with Graphs. Appendix. Glossary of Counting. Graph Theory Terms. Bibliography. Solutions to Odd-Numbered Problems. Index.