Bücher von Bela Bollobas

With the advent of digital computers more than half a century ago, - searchers working in a wide range of scienti?c disciplines have obtained an extremely powerful tool to pursue deep understanding of natural processes in physical, chemical, and biological systems. Computers pose a great ch- lenge to mathematical sciences, as the range of phenomena available for rigorous mathematical analysis has been enormously expanded, demanding the development of a new generation of mathematical tools. There is an explosive growth of new mathematical disciplines to satisfy this demand, in particular related to discrete mathematics. However, it can be argued that at large mathematics is yet to provide the essential breakthrough to meet the challenge. The required paradigm shift in our view should be compa- ble to the shift in scienti?c thinking provided by the Newtonian revolution over 300 years ago. Studies of large-scale random graphs and networks are critical for the progress, using methods of discrete mathematics, probabil- tic combinatorics, graph theory, and statistical physics. Recent advances in large scale random network studies are described in this handbook, which provides a signi?cant update and extension - yond the materials presented in the "e;Handbook of Graphs and Networks"e; published in 2003 by Wiley. The present volume puts special emphasis on large-scale networks and random processes, which deemed as crucial for - tureprogressinthe?eld. Theissuesrelatedtorandomgraphsandnetworks pose very di?cult mathematical questions.

Paul Erdos was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erdos himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.

From the reviews: "e;Bela Bollobas introductory course on graph theory deserves to be considered as a watershed in the development of this theory as a serious academic subject. ... The book has chapters on electrical networks, flows, connectivity and matchings, extremal problems, colouring, Ramsey theory, random graphs, and graphs and groups. Each chapter starts at a measured and gentle pace. Classical results are proved and new insight is provided, with the examples at the end of each chapter fully supplementing the text... Even so this allows an introduction not only to some of the deeper results but, more vitally, provides outlines of, and firm insights into, their proofs. Thus in an elementary text book, we gain an overall understanding of well-known standard results, and yet at the same time constant hints of, and guidelines into, the higher levels of the subject. It is this aspect of the book which should guarantee it a permanent place in the literature."e; #Bulletin of the London Mathematical Society#1

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 Erdos and Renyi 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.

Now revised and updated, this brisk introduction to functional analysis is intended for advanced undergraduate students, typically final year, who have had some background in real analysis. The author's aim is not just to cover the standard material in a standard way, but to present results of application in contemporary mathematics and to show the relevance of functional analysis to other areas. Unusual topics covered include the geometry of finite-dimensional spaces, invariant subspaces, fixed-point theorems, and the Bishop-Phelps theorem. An outstanding feature is the large number of exercises, some straightforward, some challenging, none uninteresting.

Presents an account of graph theory. Written with students of mathematics and computer science in mind, this book reflects the state of the subject and emphasizes connections with other branches of pure mathematics. It presents a survey of fresh topics and includes more than 600 exercises.