- Häftad (Paperback)
- Antal sidor
- Cambridge University Press
- Bollobas, B. (red.)
- 226 x 149 x 23 mm
- Antal komponenter
- 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam
- 865 g
Du kanske gillar
Fri frakt inom Sverige för privatpersoner.
Skickas inom 7-10 vardagar1421
Fler böcker av Bla Bollobs
Recensioner i media
'... contains an enormous amount of material, assembled by one who has played a leading role in the development of the area.' Zentralblatt MATH
'This book, written by one of the leaders in the field, has become the bible of random graphs. This book is primarily for mathematicians interested in graph theory and combinatorics with probability and computing, but it could also be of interest to computer scientists. It is self-contained and lists numerous exercises in each chapter. As such, it is an excellent textbook for advanced courses or for self-study.' EMS
'There are many beautiful results in the theory of random graphs, and the main aim of the book is to introduce the reader and extensive account of a substantial body of methods and results from the theory of random graphs. This is a classic textbook suitable not only for mathematicians. It has clearly passed the test of time.' Internationale Mathematische Nachrichten
'... a very good and handy guidebhook for researchers.' Acta Scientiarum Mathematicarum
'The book is very impressive in the wealth of information it offers. It is bound to become a reference material on random graphs.' SIGACT News
Bloggat om Random Graphs
Bla Bollobs has taught at Cambridge University's Department of Pure Maths and Mathematical Statistics for over 25 years and has been a fellow of Trinity College for 30 years. Since 1996, he has held the unique Chair of Excellence in the Department of Mathematical Sciences at the University of Memphis. Bollobs has previously written over 250 research papers in extremal and probabilistic combinatorics, functional analysis, probability theory, isoperimetric inequalities and polynomials of graphs.
1. Probability theoretic preliminaries; 2. Models of random graphs; 3. The degree sequence; 4. Small subgraphs; 5. The evolution of random graphs - sparse components; 6. The evolution of random graphs-the giant component; 7. Connectivity and components; 8. Long paths and cycles; 9. The automorphism group; 10. The diameter; 11. Cliques, independent sets and colouring; 12. Ramsey theory; 13. Explicit constructions; 14. Sequences, matrices and permutations; 15. Sorting algorithms; 16. Random graphs of small order.