Béla Bollobás

Bollobás Béla

This is a revised and updated version of the classic first edition.

Random Graphs

The ever-expanding field of extremal graph theory encompasses an array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume presents a concise yet comprehensive treatment, featuring complete proofs for almost all of its results and numerous exercises. 1978 edition.

Extremal Graph Theory

Entertaining, surprising and challenging mathematics problems of the sort pondered by generations during afternoon tea.

Tea Time in Cambridge

The Art of Mathematics – Take Two

Lovers of mathematics, young and old, professional and amateur, will enjoy this book. It is mathematics with fun: a collection of attractive problems that will delight and test readers. Many of the problems are drawn from the large number that have entertained and challenged students, guests and colleagues over the years during afternoon tea. The problems have their roots in many areas of mathematics. They vary greatly in difficulty: some are very easy, but most are far from trivial, and quite a few rather hard. Many provide substantial and surprising results that form the tip of an iceberg, providing an introduction to an important topic. To enjoy and appreciate the problems, readers should browse the book choosing one that looks particularly enticing, and think about it on and off for a while before resorting to the hint or the solution. Follow threads for an enjoyable and enriching journey through mathematics.

Proceedings of the Cambridge Combinatorial Conference, in Honour of Paul Erdös

Graph Theory and Combinatorics

Problems in extremal graph theory have traditionally been tackled by ingenious methods which made use of the structure of extremal graphs. In this book, an update of his 1978 book ""Extremal Graph Theory"", the author focuses on a trend towards probabilistic methods. He demonstrates both the direct use of probability theory and, more importantly, the fruitful adoption of a probabilistic frame of mind when tackling main line extremal problems. Essentially self-contained, the book does not merely catalog results, but rather includes considerable discussion on a few of the deeper results. The author addresses pure mathematicians, especially combinatorialists and graduate students taking graph theory, as well as theoretical computer scientists. He assumes a mature familiarity with combinatorial methods and an acquaintance with basic graph theory. The book is based on the NSF-CBMS Regional Conference on Graph Theory held at Emory University in June, 1984.

Extremal Graph Theory with Emphasis on Probabilistic Methods

Paul Erdős

Bela Bollobas

Andrew Thomason

A panorama of combinatorics by the world's experts.

A Tribute to Paul Erdös

Combinatorics, Geometry and Probability

A collection of mathematical problems chosen to illustrate the mathematician's art.

Béla Bollobás

About

Books

Join the club