Applied Combinatorics
2nd Edition
Published on 27. September 2004
Book
Hardback
848 pages
978-0-13-079603-5 (ISBN)
Description
For courses in undergraduate Combinatorics for juniors or seniors.
This carefully crafted text emphasizes applications and problem solving. It is divided into 4 parts. Part I introduces basic tools of combinatorics, Part II discusses advanced tools, Part III covers the existence problem, and Part IV deals with combinatorial optimization.
This carefully crafted text emphasizes applications and problem solving. It is divided into 4 parts. Part I introduces basic tools of combinatorics, Part II discusses advanced tools, Part III covers the existence problem, and Part IV deals with combinatorial optimization.
Reviews / Votes
"The writing style is excellent. Roberts' original text has always been one of my favorites and the new edition maintains the same high standards. Roberts and Tesman reads as well as the original, I'm pleased to say. The explanations are detailed enough that the students can follow the arguments readily. The motivating examples are a truly strong point for the text. No other text with which I am familiar comes even close to the number of applications presented here." - John Elwin, San Diego State University"I began using this book last fall in an undergraduate course. I used it because I believe it is one of the best books on the market for the purpose of this class. The text is written clearly throughout. The book is very well suited for a junior/senior course consisting of mathematics and computer science majors." - Joachim Rosentahal, University of Notre Dame
"The new material in this reviewed manuscript makes this new edition even stronger than the old text. I love the inclusion of extra material on cryptography and code. The writing style is clear and straightforward. The examples and clarity of explanations are quite good." - Edward Allen, Wake Forest University
More details
Edition
2nd edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 244 mm
Width: 183 mm
Thickness: 29 mm
Weight
1382 gr
ISBN-13
978-0-13-079603-5 (9780130796035)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Previous edition
Content
1. What Is Combinatorics?
2. Basic Counting Rules.
3. Introduction to Graph Theory.
4. Generating Functions and Their Applications.
5. Recurrence Relations.
6. The Principle of Inclusion and Exclusion.
7. The Polya Theory of Counting.
8. Experimental Design.
9. Coding Theory.
10. Existence Problems in Graph Theory.
11. Matching and Covering.
12. Optimization Problems for Graphs and Networks.
2. Basic Counting Rules.
3. Introduction to Graph Theory.
4. Generating Functions and Their Applications.
5. Recurrence Relations.
6. The Principle of Inclusion and Exclusion.
7. The Polya Theory of Counting.
8. Experimental Design.
9. Coding Theory.
10. Existence Problems in Graph Theory.
11. Matching and Covering.
12. Optimization Problems for Graphs and Networks.