• List Price: $54.95
  • Save: $35.95 (65%)
Rented from apex_media
To Rent, select Shipping State from options above
Due Date: Dec 20, 2014
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Used: Good | Details
Sold by apex_media
Condition: Used: Good
Comment: Ships direct from Amazon! Qualifies for Prime Shipping and FREE standard shipping for orders over $25. Overnight and 2 day shipping available!
Access codes and supplements are not guaranteed with used items.
Qty:1
  • List Price: $54.95
  • Save: $9.97 (18%)
In Stock.
Ships from and sold by Amazon.com.
Gift-wrap available.
Combinatorics and Graph T... has been added to your Cart
Trade in your item
Get a $15.87
Gift Card.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Combinatorics and Graph Theory (Undergraduate Texts in Mathematics) Paperback – December 1, 2010

ISBN-13: 978-1441927231 ISBN-10: 1441927239 Edition: Softcover reprint of hardcover 2nd ed. 2008

Buy New
Price: $44.98
Rent
Price: $19.00
29 New from $40.09 12 Used from $36.25
Rent from Amazon Price New from Used from
eTextbook
"Please retry"
$11.26
Paperback
"Please retry"
$19.00
$44.98
$40.09 $36.25
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

Combinatorics and Graph Theory (Undergraduate Texts in Mathematics) + How to Prove It: A Structured Approach
Price for both: $72.78

Buy the selected items together
  • How to Prove It: A Structured Approach $27.80

NO_CONTENT_IN_FEATURE
Best Books of the Month
Best Books of the Month
Want to know our Editors' picks for the best books of the month? Browse Best Books of the Month, featuring our favorite new books in more than a dozen categories.

Product Details

  • Series: Undergraduate Texts in Mathematics
  • Paperback: 381 pages
  • Publisher: Springer; Softcover reprint of hardcover 2nd ed. 2008 edition (December 1, 2010)
  • Language: English
  • ISBN-10: 1441927239
  • ISBN-13: 978-1441927231
  • Product Dimensions: 9.1 x 6.1 x 0.9 inches
  • Shipping Weight: 1.6 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (12 customer reviews)
  • Amazon Best Sellers Rank: #1,062,195 in Books (See Top 100 in Books)

Editorial Reviews

Review

From the reviews:

SIAM REVIEW

"The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study"

From the reviews of the second edition:

“Any undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook … . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. … Each chapter concludes with extensive notes on further reading.” (Brian Hopkins, Mathematical Reviews, Issue 2010 b)

 “Combinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. … The book is written in a reader-friendly style and there are enough exercises. … It is certainly good that someone took the effort to write … in a form that is appropriate for undergraduates. … the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it.” (Miklós Bóna, SIGACT News, Vol. 40 (3), 2009)

“This undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. … There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter. A full list of 293 references, about 550 exercises and an index with 13 pages are also provided.” (Dalibor Froncek, Zentralblatt MATH, Vol. 1170, 2009)

From the Back Cover

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:

• New sections in graph theory on distance, Eulerian trails, and Hamiltonian paths.

• New material on partitions, multinomial coefficients, and the pigeonhole principle.

• 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.

• Topics in combinatorial geometry, including Erdos and Szekeres’ development of Ramsey Theory in a problem about convex polygons determined by sets of points.

• Expanded coverage of stable marriage problems, and new sections on marriage problems for infinite sets, both countable and uncountable.

• 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


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.0 out of 5 stars
5 star
5
4 star
3
3 star
3
2 star
1
1 star
0
See all 12 customer reviews
One of the best textbooks I've ever read.
audiod
Those looking for a more classical definition-theorem-proof style textbook should look elsewhere.
Max
I have found it easy to read with good explanations and ample proof examples.
Carl

Most Helpful Customer Reviews

11 of 12 people found the following review helpful By Jay Beder on May 24, 2010
Format: Hardcover
I would exercise some caution before purchasing or adopting this text. While many reviewers find the style exuberant and humorous, I find it a bit breezy and even flip, at the expense of clarity. Here's an example, the definition of an SDR:

Given some family of sets X, a system of distinct representatives, or SDR, for
the sets in X can be thought of as a "representative" collection of distinct
elements from the sets of X. For instance, .... [What follows is a collection
of 5 sets and an SDR for them, along with a subcollection of 4 sets that doesn't
have an SDR.]

"Can be thought of"? Such tentative language is not helpful, and I'm not sure that the example would nail it down for the uninitiated.

The third chapter of the book (there are just three), "Infinite combinatorics and graphs", is what initially caught my attention, but the primary emphasis here is symbolic logic and abstract set theory. Very interesting topics, but the connection to combinatorics is a bit thin.
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
7 of 8 people found the following review helpful By Max on February 3, 2010
Format: Hardcover Verified Purchase
This is by far the best math book I have ever read. The authors present the material in a clear but also incredibly engaging way. The problems are interesting and spot-on in terms of difficulty for the sophomore to junior level introductory course. Those looking for a more classical definition-theorem-proof style textbook should look elsewhere. This is not to say that the textbook lacks rigor (the proofs are very precise), but that it reads more like a narrative, so that it might not serve as the best reference. For the student, however, there really isn't much more you could ask for in a math book.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
3 of 3 people found the following review helpful By avgvstvs VINE VOICE on June 19, 2009
Format: Hardcover Verified Purchase
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Format: Hardcover Verified Purchase
I had the misfortune of having a professor who was not entirely familiar with the material presented in the class, and he used this book as a sole reference for a good 4/5 of the course. Coming into the class, I had a strong Graph Theory background, to the point where I was familiar with all of the material of the first eight weeks of class or so; yet I strongly contend that the material presented in this book does not substantially help the reader comprehend some of the more complex concepts. The chapters have a lack of detailed examples explaining proofs of theorems or otherwise give abridged proofs that are not ideal (and don't even seem like valid proofs to me!). There are no homework solutions available, not even online, so that further hinders the student because he will not have anything valid to study from. Often, some of the homework problems made sudden jumps in difficulty from the material that was presented to what was expected of the student. Some problems had solutions where no similar intuition or reasoning was presented in the chapter before, so it required vast amounts of re-reading and looking for outside sources (or relying on classmates like me who knew it) for most students in my class.

My negative experience was especially compounded by my professor's ineptitude at Graph Theory, but trying to set that bias aside I really wish this book was turned into a full textbook that worked on fixing its many flaws. My biggest peeve is that it is very hard to use as a reference since the authors do not even glossary concepts. Most are italicized (which is impossible to spot in this font), but still others are just not.

Overall, perhaps a future version will be worth using in the classroom or for reference, but this version is not able to reach those standards.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
2 of 2 people found the following review helpful By Everett Schleter on August 29, 2013
Format: Hardcover Verified Purchase
I would love it if there were answers to exercises. Maybe they exist in another document. If so I would buy it.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By Marc Mest on February 3, 2012
Format: Paperback Verified Purchase
I used this as a self-study for graph theory. The combinatorics part of it was just icing on the cake.

The problem I had with discrete math textbooks were they treated graph theory as some sort of sideshow attraction to fill the book.
And the point was to show off neat examples, and not really provide a solid foundation in graph theory.

The authors go beyond Eulers bridges problem and color counting. The theorems are presented with the proofs, and they have just enough examples to instruct. Could they add a bunch more examples and flashy sidebars? sure. However, the authors provide enough examples when needed without fluff, but more important they provide solid coverage on graph theory.

The only real negative is the writing style is not as great as one would hope.

Combinatorics coverage has some interesting depth beyond the standard textbooks. The stable marriage problem alone is examined to n-degrees of depth with variations on solutions.
Polyas theory of counting is extensively presented as well. ( Yes Euler gets his number theory coverage as well ).

Overall there are flaws with the book, but nothing earth shattering. The authors did a great job of covering the topics beyond the basics, and leveraged examples to illustrate variations which really made this book shine.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

What Other Items Do Customers Buy After Viewing This Item?