{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":31,"n_cols":5,"rows_kept":31,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[13,2,13,3],[17,2,17,3],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910141243703321"]
[null,null,"Autore",null,"Janson Svante"]
[null,null,"Titolo",null,"Random graphs / / Svante Janson, Tomasz Luczak, Andrzej Rucinski"]
[null,null,"Pubbl/distr/stampa",null,"New York, New York : , : John Wiley & Sons, Inc., , 2000"]
[{"$nulls":4},"©2000"]
[null,null,"ISBN",null,"1-118-03271-3"]
[{"$nulls":4},"1-118-03096-6"]
[null,null,"Descrizione fisica",null,"1 online resource (350 p.)"]
[null,null,"Collana",null,"Wiley-Interscience Series in Discrete Mathematics and Optimization"]
[null,null,"Disciplina",null,"511.5"]
[{"$nulls":4},"511/.5"]
[null,null,"Soggetti",null,"Random graphs"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"A Wiley-Interscience Publication.\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and indexes."]
[null,null,"Nota di contenuto",null,"Random Graphs; Preface; Contents; 1 Preliminaries; 1.1 Models of random graphs; 1.2 Notes on notation and more; 1.3 Monotonicity; 1.4 Asymptotic equivalence; 1.5 Thresholds; 1.6 Sharp thresholds; 2 Exponentially Small Probabilities; 2.1 Independent summands; 2.2 Binomial random subsets; 2.3 Suen's inequality; 2.4 Martingales; 2.5 Talagrand's inequality; 2.6 The upper tail; 3 Small Subgraphs; 3.1 The containment problem; 3.2 Leading overlaps and the subgraph plot; 3.3 Subgraph count at the threshold; 3.4 The covering problem; 3.5 Disjoint copies; 3.6 Variations on the theme; 4 Matchings"]
[{"$nulls":4},"4.1 Perfect matchings4.2 G-factors; 4.3 Two open problems; 5 The Phase Transition; 5.1 The evolution of the random graph; 5.2 The emergence of the giant component; 5.3 The emergence of the giant: A closer look; 5.4 The structure of the giant component; 5.5 Near the critical period; 5.6 Global properties and the symmetry rule; 5.7 Dynamic properties; 6 Asymptotic Distributions; 6.1 The method of moments; 6.2 Stein's method: The Poisson case; 6.3 Stein's method: The normal case; 6.4 Projections and decompositions; 6.5 Further methods; 7 The Chromatic Number; 7.1 The stability number"]
[{"$nulls":4},"7.2 The chromatic number: A greedy approach7.3 The concentration of the chromatic number; 7.4 The chromatic number of dense random graphs; 7.5 The chromatic number of sparse random graphs; 7.6 Vertex partition properties; 8 Extremal and Ramsey Properties; 8.1 Heuristics and results; 8.2 Triangles: The first approach; 8.3 The Szemerédi Regularity Lemma; 8.4 A partition theorem for random "]
[{"$nulls":4},"graphs; 8.5 Triangles: An approach with perspective; 9 Random Regular Graphs; 9.1 The configuration model; 9.2 Small cycles; 9.3 Hamilton cycles; 9.4 Proofs; 9.5 Contiguity of random regular graphs"]
[{"$nulls":4},"9.6 A brief course in contiguity10 Zero-One Laws; 10.1 Preliminaries; 10.2 Ehrenfeucht games and zero-one laws; 10.3 Filling gaps; 10.4 Sums of models; 10.5 Separability and the speed of convergence; References; Index of Notation; Index"]
[null,null,null,"Sommario/riassunto","A unified, modern treatment of the theory of random graphs-including recent results and techniquesSince its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the"]
[null,"2.","Record Nr.",null,"UNISOBSOB016574"]
[null,null,"Titolo",null,"I servizi pubblici locali : Organizzazione, gare, gestione delle reti, erogazione dei servizi, affidamento, aspetti fiscali e responsabilità : Problemi, casi pratici e formulario : Guida operativa / coord. Vittorio Italia"]
[null,null,"Pubbl/distr/stampa",null,"Milano, : Giuffré, 2002"]
[null,null,"ISBN",null,"8814095450"]
[null,null,"Descrizione fisica",null,"774 p. ; 24 cm + 1 CD-ROM"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]