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
- 9% Preț: 739.45 lei
- Preț: 207.14 lei
- Preț: 229.80 lei
- Preț: 229.29 lei
- Preț: 229.18 lei
- Preț: 340.79 lei
- Preț: 403.06 lei
- Preț: 365.04 lei
- Preț: 287.37 lei
- Preț: 385.34 lei
- Preț: 429.18 lei
- Preț: 319.23 lei
- Preț: 327.93 lei
- Preț: 439.43 lei
- Preț: 370.84 lei
- 11% Preț: 417.55 lei
- 11% Preț: 510.32 lei
- Preț: 316.14 lei
- Preț: 360.39 lei
- Preț: 268.34 lei
- Preț: 311.28 lei
- Preț: 454.41 lei
- Preț: 309.60 lei
- Preț: 308.25 lei
- 11% Preț: 416.36 lei
- 11% Preț: 451.31 lei
- 11% Preț: 631.44 lei
- Preț: 382.24 lei
- Preț: 359.45 lei
- 11% Preț: 459.02 lei
- Preț: 340.76 lei
- Preț: 394.87 lei
- 11% Preț: 645.89 lei
- Preț: 309.39 lei
- 11% Preț: 412.95 lei
Preț: 484.87 lei
Preț vechi: 544.79 lei
-11% Nou
Puncte Express: 727
Preț estimativ în valută:
92.79€ • 96.06$ • 78.43£
92.79€ • 96.06$ • 78.43£
Carte tipărită la comandă
Livrare economică 05-19 martie
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.