Random Graphs, Geometry and Asymptotic Structure: London Mathematical Society Student Texts, cartea 84
Autor Michael Krivelevich, Konstantinos Panagiotou, Mathew Penrose, Colin McDiarmid Editat de Nikolaos Fountoulakis, Dan Hefetzen Limba Engleză Hardback – 24 apr 2016
Din seria London Mathematical Society Student Texts
- 14%
Preț: 793.93 lei -
Preț: 437.01 lei -
Preț: 247.71 lei -
Preț: 248.74 lei -
Preț: 248.20 lei -
Preț: 393.61 lei - 14%
Preț: 1051.34 lei -
Preț: 248.06 lei -
Preț: 385.14 lei -
Preț: 394.74 lei -
Preț: 319.17 lei -
Preț: 388.86 lei -
Preț: 325.34 lei - 11%
Preț: 423.12 lei -
Preț: 324.12 lei - 11%
Preț: 417.86 lei -
Preț: 446.84 lei -
Preț: 374.94 lei -
Preț: 379.44 lei -
Preț: 232.45 lei - 14%
Preț: 902.90 lei - 11%
Preț: 517.59 lei -
Preț: 364.89 lei -
Preț: 275.47 lei -
Preț: 324.72 lei - 11%
Preț: 410.51 lei -
Preț: 316.08 lei -
Preț: 314.77 lei - 11%
Preț: 421.97 lei - 11%
Preț: 460.92 lei - 19%
Preț: 653.30 lei -
Preț: 385.88 lei -
Preț: 404.40 lei - 11%
Preț: 468.31 lei -
Preț: 346.01 lei -
Preț: 404.04 lei - 11%
Preț: 658.52 lei
Preț: 493.10 lei
Preț vechi: 554.03 lei
-11% Nou
Puncte Express: 740
Preț estimativ în valută:
87.27€ • 102.34$ • 76.52£
87.27€ • 102.34$ • 76.52£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781107136571
ISBN-10: 1107136571
Pagini: 127
Ilustrații: 2 b/w illus. 1 table
Dimensiuni: 158 x 235 x 13 mm
Greutate: 0.3 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria London Mathematical Society Student Texts
Locul publicării:New York, United States
ISBN-10: 1107136571
Pagini: 127
Ilustrații: 2 b/w illus. 1 table
Dimensiuni: 158 x 235 x 13 mm
Greutate: 0.3 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria London Mathematical Society Student Texts
Locul publicării:New York, United States
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)
Notă biografică
Descriere
A concise introduction, aimed at young researchers, to recent developments of a geometric and topological nature in random graphs.