Combinatorics and Graph Theory (Undergraduate Texts in Mathematics) |  | Authors: John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff
Publisher: Springer
List Price: $49.95
Buy New: $29.50
as of 11/21/2009 00:31 CST details
You Save: $20.45 (41%)
New (28) Used (13) from $29.50
Seller: BOOKS__UNLIMITED
Rating:  6 reviews
Sales Rank: 495929
Media: Hardcover
Edition: 2nd ed.
Pages: 382
Number Of Items: 1
Shipping Weight (lbs): 1.5
Dimensions (in): 9.3 x 6 x 0.9
ISBN: 0387797106
Dewey Decimal Number: 511
EAN: 9780387797106
ASIN: 0387797106
Publication Date: September 19, 2008
Availability: Usually ships in 1-2 business days
| |
| Features:
|
| Also Available In:
|
| Similar Items:
| |
| Editorial Reviews:
Product Description
This book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The second edition includes many new topics and features: (1) New sections in graph theory on distance, Eulerian trails, and hamiltonian paths. (2) New material on partitions, multinomial coefficients, and the pigeonhole principle. (3) Expanded coverage of Pólya Theory to include de Bruijn’s method for counting arrangements when a second symmetry group acts on the set of allowed colors. (4) Topics in combinatorial geometry, including Erdos and Szekeres’ development of Ramsey Theory in a problem about convex polygons determined by sets of points. (5) Expanded coverage of stable marriage problems, and new sections on marriage problems for infinite sets, both countable and uncountable. (6) Numerous new exercises throughout the book. About the First Edition: “. . . this is what a textbook should be! The book is comprehensive without being overwhelming, the proofs are elegant, clear and short, and the examples are well picked.” — Ioana Mihaila, MAA Reviews
|
| Customer Reviews:
Showing reviews 1-5 of 6
Doesn't Give Away the Store... June 19, 2009
avgvstvs (Omaha NE)
1 out of 1 found this review helpful
My background: I am an MIS major that discovered too late that he had an intense love for the mathematics behind the magic of computer science. I had previously only taken business calc(!) and Discrete Math (for CS majors). The book assigned was Tucker's book which does a great job on generating functions, but loses brevity completely when entering the field of recursive relations.
This book's explanations dealing with poker hands did what Tucker's and Grimaldi's books left me hanging on. Treatment on the binomial theorem and its related applications was also very thorough and at an acceptable level. The beauty of this book however is that the exercises rapidly increase in punch, and I still return to it from time to time to tease out new relationships.
It's introduction to graph theory is also very stellar... and it decides to introduce it before the combinatorial arguments, which if I'd had a little stronger comp sci background before taking the class, I would have found a much more gradual introduction to the general theories.
I'm still raising in mathematical ability, and I plan on tackling this book when I've gotten a little more maturity under my belt.
Excellent book. Hands down.
An excellent book January 10, 2009
Shahab (India)
I haven't gone through the whole book yet but the portion on graph theory that I have read is brilliantly written. The authors inject humor and beauty in the subject. If you are a self learner then this book is ideal for you. The only negative point is the total lack of answers/hints to the problems in the exercises.
Glorious November 19, 2007
J. Wilkes
1 out of 1 found this review helpful
The authors of this book have managed to teach, in a complete and thorough manner, enough material to fill a book more than twice the size of this one. Do not mistake its brevity for a Rudin-esque lack of explanation, or for a lack of substance. Explanations are provided, a good deal of material is covered, and the book remains so concise and to the point that I have no complaints whatsoever.
Very few math books lend themselves well to being read cover-to-cover, but the unassuming nature of this book makes it perfect for a leisurely and fun read, or for a classroom.
Fans of the writing style of Joseph Gallian's "Contemporary Abstract Algebra" will enjoy this book's ability to present material in a friendly way without oversimplifying.
Buy this book.
A truly elegant introduction to combinatorics May 23, 2007
Peter M. Magyar (East Lansing, MI United States)
5 out of 5 found this review helpful
Unlike its competitors, this book states simple concepts simply. It gives an excellent selection of the most important techniques and examples, without endlessly repeated "real-world" applications. In 80 pages, it covers the most interesting topics in graph theory, including: Cayley's tree-counting theorem, vertex coloring (with proof of the 5-Color Theorem), Hall matching theorem, Ramsey numbers, and stable marriage. Another 80 pages contains the main concepts of enumeration: elementary combinations (poker hands), inclusion-exclusion, generating functions for Fibonacci and Catalan numbers, Polya counting of symmetry classes, Stirling numbers. There is final section on infinite sets and graphs.
The book covers quite as much as similar ones of twice the length. Finally, a textbook which is not afraid to be brief!
Perfect book for self teaching March 4, 2007
Richard A. Robertson (Jacksonville, FL United States)
12 out of 13 found this review helpful
I am a math student with Indiana University working out of this book for independent study credit. When my adviser and I sat down to discuss books, we sifted through 10 to 12 books, and it was clear from the start that this book was the best. And I haven't changed my mind since. The book is clear, concise, and easy to read. Excellent for anyone who is teaching themselves, which of course means it's great for a full course with actual instructors.
Showing reviews 1-5 of 6
|
|
|
|
