Stock photo: cover may vary
Random Graphs Hardback - 2000
by Janson, Svante
- Used
- Hardback
- first
A$280.13
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Standard delivery: 5 to 10 days
Dropship order
Ships from Ergodebooks (Texas, United States)
Details
- Title Random Graphs
- Author Janson, Svante
- Binding Hardback
- Edition 1
- Condition Used: Good
- Pages 348
- Volumes 1
- Language ENG
- Publisher Wiley, ^^ in Stock: we Ship at Once fr. IL USA;
- Publication date 2000-03-13
- Illustrated Yes
- Features Bibliography, Illustrated, Index
- Bookseller's Inventory # SONG0471175412
- ISBN 9780471175414 / 0471175412
- Weight 1.25 lbs (0.57 kg)
- Dimensions 9.7 x 6.4 x 0.82 in (24.64 x 16.26 x 2.08 cm)
- Size 6.46x0.87x9.47
- Category Mathematics
- Library of Congress subjects Random graphs
- Library of Congress Catalogue Number 99089121
- Dewey Decimal Code 511.5
- Quantity available 1
About Ergodebooks Texas, United States
Biblio member since 2005
Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.
We have 30 day return policy.
Reader reviews for Random Graphs
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
First line
HASH(0x11148360)
From the rear cover
A unified, modern treatment of the theory of random graphs-including recent results and techniques
Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include:
* A focus on the fundamental theory as well as basic models of random graphs
* A detailed description of the phase transition phenomenon
* Easy-to-apply exponential inequalities for large deviation bounds
* An extensive study of the problem of containing small subgraphs
* Results by Bollobas and others on the chromatic number of random graphs
* The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs
* A gentle introduction to the zero-one laws
* Ample exercises, figures, and bibliographic references
Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include:
* A focus on the fundamental theory as well as basic models of random graphs
* A detailed description of the phase transition phenomenon
* Easy-to-apply exponential inequalities for large deviation bounds
* An extensive study of the problem of containing small subgraphs
* Results by Bollobas and others on the chromatic number of random graphs
* The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs
* A gentle introduction to the zero-one laws
* Ample exercises, figures, and bibliographic references
Media reviews
Citations
- Scitech Book News, 12/01/2000, Page 35
