Random graphs (Record no. 1831)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01968nam a2200217Ia 4500 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | OSt |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240923172003.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 180427s9999 xx 000 0 und d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9780521797221 |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | ICTS-TIFR |
050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA166.17 |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Béla Bollobás |
245 ## - TITLE STATEMENT | |
Title | Random graphs |
250 ## - EDITION STATEMENT | |
Edition statement | 2nd ed. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Name of publisher, distributor, etc. | Cambridge, U.K., |
Date of publication, distribution, etc. | [c2001] |
Place of publication, distribution, etc. | Cambridge University Press: |
300 ## - Physical Description | |
Pages: | 498 p. |
505 ## - FORMATTED CONTENTS NOTE | |
Formatted contents note | 1 - Probability Theoretic Preliminaries<br/>2 - Models of Random Graphs <br/>3 - The Degree Sequence <br/>4 - Small Subgraphs <br/>5 - The Evolution of Random Graphs—Sparse Components <br/>6 - The Evolution of Random Graphs—the Giant Component<br/>7 - Connectivity and Matchings <br/>8 - Long Paths and Cycles <br/>9 - The Automorphism Group <br/>10 - The Diameter <br/>11 - Cliques, Independent Sets and Colouring <br/>12 - Ramsey Theory <br/>13 - Explicit Constructions <br/>14 - Sequences, Matrices and Permutations <br/>15 - Sorting Algorithms <br/>16 - Random Graphs of Small Order |
520 ## - SUMMARY, ETC. | |
Summary, etc. | In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdös and Rényi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.--- summary provided by publisher |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Mathematics |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | |
Koha item type | Book |
Withdrawn status | Lost status | Damaged status | Not for loan | Collection code | Home library | Shelving location | Date acquired | Full call number | Accession No. | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|
ICTS | Rack No 4 | 04/16/2018 | QA166.17 | 01101 | Book |