Random Graphs, Geometry and Asymptotic Structure
Autor Michael Krivelevich, Konstantinos Panagiotou, Mathew Penrose, Colin McDiarmid Editat de Nikolaos Fountoulakis, Dan Hefetzen Limba Engleză Paperback – 26 apr 2016
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 230.18 lei 24-36 zile | |
| Cambridge University Press – 26 apr 2016 | 230.18 lei 24-36 zile | |
| Hardback (1) | 493.10 lei 6-8 săpt. | |
| Cambridge University Press – 24 apr 2016 | 493.10 lei 6-8 săpt. |
Preț: 230.18 lei
Preț vechi: 317.74 lei
-28%
Puncte Express: 345
Preț estimativ în valută:
40.69€ • 48.52$ • 35.29£
40.69€ • 48.52$ • 35.29£
Carte indisponibilă temporar
Specificații
ISBN-13: 9781316501917
ISBN-10: 1316501914
Pagini: 127
Ilustrații: 2 b/w illus. 1 table
Dimensiuni: 151 x 226 x 10 mm
Greutate: 0.19 kg
Editura: Cambridge University Press
Locul publicării:Cambridge, United Kingdom
ISBN-10: 1316501914
Pagini: 127
Ilustrații: 2 b/w illus. 1 table
Dimensiuni: 151 x 226 x 10 mm
Greutate: 0.19 kg
Editura: Cambridge University Press
Locul publicării:Cambridge, United Kingdom
Cuprins
Editors' introduction; Part I. Long Paths and Hamiltonicity in Random Graphs: 1. Introduction; 2. Tools; 3. Long paths in random graphs; 4. The appearance of Hamilton cycles in random graphs; References for Part I; Part II. Random Graphs from Restricted Classes: 1. Introduction; 2. Random trees; 3. Random graphs from block-stable classes; References for Part II; Part III. Lectures on Random Geometric Graphs: 1. Introduction; 2. Edge counts; 3. Edge counts: normal approximation; 4. The maximum degree; 5. A sufficient condition for connectivity; 6. Connectivity and Hamiltonicity; 7. Solutions to exercises; References for Part III; Part IV. On Random Graphs from a Minor-closed Class: 1. Introduction; 2. Properties of graph classes; 3. Bridge-addability, being connected and the fragment; 4 Growth constants; 5. Unlabelled graphs; 6. Smoothness; 7. Concluding remarks; References for Part IV; Index.
Recenzii
'The chapter on geometric graphs has plenty of exercises … the book will help many novices make their first steps in the field of random graphs.' Miklós Bóna, MAA Reviews (www.maa.org)
Descriere
A concise introduction, aimed at young researchers, to recent developments of a geometric and topological nature in random graphs.