• List Price: $94.99
  • Save: $63.52 (67%)
Rented from RentU
To Rent, select Shipping State from options above
Due Date: May 28, 2015
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Used: Good | Details
Sold by tamarbooks
Condition: Used: Good
Comment: Paperback in good condition. Text is clean, cover is scratched and shows wear.
Access codes and supplements are not guaranteed with used items.
Qty:1
  • List Price: $94.99
  • Save: $11.83 (12%)
In Stock.
Ships from and sold by Amazon.com.
Gift-wrap available.
Random Graphs (Cambridge ... has been added to your Cart
Sell yours for a Gift Card
We'll buy it for $14.87
Learn More
Trade in now
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

Random Graphs (Cambridge Studies in Advanced Mathematics) Paperback – October 8, 2001

ISBN-13: 978-0521797221 ISBN-10: 0521797225 Edition: 2nd

Buy New
Price: $83.16
Rent
Price: $31.47
20 New from $83.14 19 Used from $56.75
Rent from Amazon Price New from Used from
Paperback
"Please retry"
$31.47
$83.16
$83.14 $56.75
Best%20Books%20of%202014
$83.16 FREE Shipping. In Stock. Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

Random Graphs (Cambridge Studies in Advanced Mathematics) + Random Graphs + The Probabilistic Method
Price for all three: $307.61

Buy the selected items together

Customers Who Bought This Item Also Bought

NO_CONTENT_IN_FEATURE

Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Series: Cambridge Studies in Advanced Mathematics (Book 73)
  • Paperback: 518 pages
  • Publisher: Cambridge University Press; 2 edition (October 8, 2001)
  • Language: English
  • ISBN-10: 0521797225
  • ISBN-13: 978-0521797221
  • Product Dimensions: 6 x 1.1 x 9 inches
  • Shipping Weight: 1.9 pounds (View shipping rates and policies)
  • Average Customer Review: 3.5 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #1,060,765 in Books (See Top 100 in Books)

Editorial Reviews

Review

"An up-to-date, comprehensive account of the random graph theory, this edition of what's considered a "classic" text contians two new sections, numerous new results, and over 150 references."
Poptronics

"The book is very impressive in the wealth of information it offers. It is bound to become a reference material on random graphs."
Miklos Bona, SIGACT News

Book Description

This is a new edition of a now classic text. The already extensive treatment given in the first edition has been heavily revised by the author, an acknowleged expert. The addition of two new sections, numerous new results and over 150 references mean that this represents an up-to-date account of random graph theory. This book can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.

More About the Author

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

Customer Reviews

3.5 out of 5 stars
5 star
0
4 star
1
3 star
1
2 star
0
1 star
0
See both customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

5 of 5 people found the following review helpful By Narada on October 11, 2010
Format: Hardcover
And has a lot of material, but the organization leaves much to be desired, and standard results in the field are there but very difficult to find (for example, good luck finding the proof of the classical Erdos-Renyi theorem on connectivity threshold for random graphs. The canonical proof is about half a page, while the proof you can back out of Bollobas is maybe two chapters. The configuration model (which is actually due to the author) is actually very simple and explained well in papers by N. Wormald. It is a little painful to read about in this book. Perhaps the most widely used property of random graphs is that they have the expander property (another result of Erdos). This is also carefully hidden.

It is also a little painful for me to give a less than glowing review of this, since I really like Modern Graph Theory, and random graphs are pervasive in modern mathematics, so we really need a good book. This one is not bad, but...
2 Comments 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
5 of 9 people found the following review helpful By PST on July 9, 2005
Format: Paperback
This is the second book by Dr. Bollobas that I have read, and it is clear, that Dr. Bollobas is a master in the field.

It is amazing, how few lines he needs to motivate the subject matter completely.

The gaps in the proofs were sometimes large for me, but then again, the audience he wishes to address are "research students and professional mathematicians", and I am only a hobby mathematician.

The only minus point are the large number of misprints: I counted over 130 of them, and this is not counting misprints like 'some' instead of 'same', etc. This is very annoying if one uses the book for self study.

(Unfortunaltely misprints seem Dr. Bollobas' problem: Also the other book I read: 'Modern Graph Theory' had more than its share)
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?