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ț: 797.01 lei - 11%
Preț: 424.76 lei -
Preț: 448.56 lei - 11%
Preț: 597.75 lei -
Preț: 256.23 lei - 14%
Preț: 906.39 lei -
Preț: 376.37 lei - 14%
Preț: 1055.43 lei -
Preț: 327.41 lei -
Preț: 256.39 lei - 11%
Preț: 519.59 lei -
Preț: 366.29 lei -
Preț: 276.53 lei - 11%
Preț: 412.09 lei -
Preț: 319.29 lei -
Preț: 317.97 lei - 11%
Preț: 426.25 lei - 11%
Preț: 462.68 lei - 19%
Preț: 655.83 lei -
Preț: 385.88 lei -
Preț: 405.94 lei - 14%
Preț: 282.11 lei - 11%
Preț: 470.12 lei -
Preț: 349.53 lei - 11%
Preț: 661.06 lei -
Preț: 319.08 lei - 11%
Preț: 420.31 lei -
Preț: 374.81 lei - 11%
Preț: 593.64 lei - 11%
Preț: 418.83 lei - 11%
Preț: 415.07 lei -
Preț: 364.76 lei -
Preț: 403.34 lei - 11%
Preț: 465.67 lei -
Preț: 443.48 lei
Preț: 494.98 lei
Preț vechi: 556.17 lei
-11%
Puncte Express: 742
Carte tipărită la comandă
Livrare economică 25 iunie-09 iulie
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)
Descriere
A concise introduction, aimed at young researchers, to recent developments of a geometric and topological nature in random graphs.