This is a new 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 an
up-to-date and comprehensive account of random graph theory. The
theory estimates 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.
Bela Bollobas. Random Graphs
- формат pdf
- размер 17.97 МБ
- добавлен 09 октября 2011 г.
Похожие разделы
Смотрите также
Bollob?s B. (ed.) Advances in Graph Theory
- формат djvu
- размер 2.16 МБ
- добавлен 23 октября 2011 г.
Издательство North Holland, 1978, -305 pp. Annals of Discrete Mathematics, Number 3. which received an equally memorable reply. Several of the papers were quickly and efficiently retyped by Mrs. J.E. Scutt. The editorial burden was greatly relieved by the excellent work of Mr. A.G. Thomason. Linear separation of dominating sets in graphs. Regularisable graphs. Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Extremal gr...
Bollob?s B. (ed.) Graph Theory
- формат djvu
- размер 1.12 МБ
- добавлен 23 октября 2011 г.
Издательство North Holland, 1982, -210 pp. Annals of Discrete Mathematics, Number 13. Proceedings of the Conference on Graph Theory, Cambridge. The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contributions, suitably refereed and revised. For many years now,...
Bollob?s B. Graph Theory and Combinatorics
- формат djvu
- размер 3 МБ
- добавлен 04 октября 2011 г.
Издательство North Holland, 1988, -419 pp. Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erd?s The 1988 Cambridge Combinatorial Conference was held at Trinity College, Cambridge, from 21 to 25 March 1988, under the auspices of the London Mathematical Society, the Department of Pure Mathematics and Mathematical Statistics of Cambridge University and Trinity College, Cambridge. The financial support from these institution...
Bollobas B. Modern Graph Theory
- формат djvu
- размер 9.99 МБ
- добавлен 13 декабря 2010 г.
Springer, 1998. - 394 pages. The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The v...
Brandst?dt A., van Bang L., Spinrad J.P. Graph Classes: a Survey
- формат djvu
- размер 2.64 МБ
- добавлен 31 января 2012 г.
Society for Industrial and Applied Mathematics, 1999, -321 pp. When dealing with special graph classes and algorithmic problems on them, a main source is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs. The book, however, appeared in 1980, and since that time many interesting new classes have been introduced. Therefore, it is probably useful to have a new survey that attempts to describe the world of special graph cla...
Chung F.R.K. Lectures on Spectral Graph Theory
- формат pdf
- размер 190.11 КБ
- добавлен 01 декабря 2011 г.
Eigenvalues and the Laplacian of a graph. The Laplacian and eigenvalues. Basic facts about the spectrum of a graph. Eigenvalues of weighted graphs. Eigenvalues and random walks. Isoperimetric problems. History. The Cheeger constant of a graph. The edge expansion of a graph. The vertex expansion of a graph. A characterization of the Cheeger constant. Isoperimetric inequalities for cartesian products. Diameters and eigenvalues. The diameter of a gr...
Drmota M., Flajolet P., Gardy D., Gittenberger B. (editors) Mathematics and Computer Science III: Algorithms, Trees, Combinatirics and Probabilities
- формат djvu
- размер 5.34 МБ
- добавлен 13 января 2011 г.
Birkh?user Basel, 2004. - 554 pages. This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers...
Lov?sz L. Combinatorial Problems and Exercises
- формат djvu
- размер 3.82 МБ
- добавлен 04 октября 2011 г.
Издательство North-Holland, 1993, -630 pp. When the publishers of this book asked me to revise and update my problem book for a second edition, I had to decide how much to change, taking into consideration the fast development of the field (but also that the first edition was out of print). Combinatorics has grown a lot in the last decade, especially in those fields interacting with other branches of mathematics, like polyhedral combinatorics,...
Ore O. Theory of graphs
- формат djvu
- размер 1.63 МБ
- добавлен 08 октября 2009 г.
279 c. 1962 г. 1. Fundamental concepts 2. Connectedness 3. Path problems 4. Trees 5. Leaves and lobes 6. The axiom of choice 7. Matching theorems 8. Directed graphs 9. Acyclic graphs 10. Partial order 11. Binary relations and Galois correspondences 12. Connecting paths 13. Dominating sets, covering sets, and independent sets 14. Chromatic graphs 15. Groups and graphs
Wilson R.J. Introduction to Graph Theory, 4th Edition
- формат pdf
- размер 13.09 МБ
- добавлен 31 января 2011 г.
Addison Wesley – 1996, 184 pages, ISBN: 0582249937. Provides a basic foundation on trees, algorithms, Eulerian and Hamilton graphs, planar graphs and coloring, with special reference to four color theorem. Discusses directed graphs and transversal theory and related these areas to Markov chains and network flows.