Béla Bollobás

Quick Info

3 August 1943
Budapest, Hungary

Professor Bollobás is a Hungarian-born British mathematician who is one of the world's leaders in combinatorics.


Béla Bollobás's father was a physician. Béla was brought up in Budapest where he attended school. He also had private tutors, not to teach him school subjects but to teach him other activities. These tutors, who had held important positions in Hungary before the Communists took over, had been forced out of their jobs and had taken up teaching. They included a former general, a count, a baroness and a former judge. Bollobás entered the mathematical competitions which were part of the Hungarian school tradition and, when he was fourteen years old, he won a national competition. By this time Paul Erdős was spending most of his time in Israel but returning to Hungary quite frequently. He was in Budapest for a couple of weeks when he heard that Bollobás had won the competition so he invited him to meet him at his hotel. They had lunch together and from that time on Erdős kept in touch with Bollobás, usually by letter but also seeing each other at times when Erdős was in Budapest. Much of Bollobás's early mathematical work was strongly influenced by Erdős and in fact his first paper Extremal problems in graph theory (Hungarian), written while still at high school, was a joint publication with Erdős appearing in 1962.

Bollobás attended Budapest University where he joined the research group headed by László Fejes Tóth who worked on discrete geometry. However, Bollobás considers Erdős to be his real advisor while he was undertaking research for his doctorate for it was Erdős who kept in contact suggesting problems for him to look at. For example Bollobás published On graphs without two independent circuits (Hungarian) in 1963 which solves a special case of a problem posed by Erdős while On generalized graphs (1965) generalises a result by Erdős, Hajnal and Moon. He also worked on packings, coverings, and tilings for his doctorate, publishing papers such as Filling the plane with congruent convex hexagons without overlapping (1963). Donald Coxeter reviewed this paper:-
The problem of filling and covering the Euclidean plane with congruent (but not necessarily "equivalent") polygons was discussed by Kepler, Hilbert ... The author obtains some significant restrictions on the possible kinds of convex hexagons that can serve as a tile. In particular, he proves that if the plane can be filled with congruent hexagons, it can be filled with the same hexagons in such a way that each vertex belongs to exactly three of them. On the other hand, vertices of higher valency can easily occur; for instance, the author has drawn a pattern of irregular (but equilateral) hexagons having the symmetry of a regular pentagon.
Since travelling to different countries was difficult for Hungarians during these years of Communist control, Bollobás always felt claustrophobic and wanted to travel. While an undergraduate he had asked Erdős to help him visit Israel (where Erdős was spending most of his time) but Erdős suggested that it would be more sensible for him to visit Cambridge in England. A strong recommendation from Erdős to Harold Davenport and a long frustrating campaign to get permission from the Communist authorities eventually paid off. Bollobás spent a year in Cambridge and, soon after returning to Hungary, received the offer of a scholarship from Cambridge to complete his Ph.D. there. However, he was not allowed to take this up and, in 1967, completed his doctorate in Budapest. He was also offered a scholarship to study in Paris, but again the authorities refused permission for him to leave the country.

Travel to Russia was more acceptable to the Hungarian authorities so, after completing his doctorate in Budapest, Bollobás spent a highly productive year in Moscow working with Israil Moiseevic Gelfand. While in Moscow, Gelfand suggested that Bollobás should try to visit Michael Atiyah or Frank Adams in England. A while after he had returned to Budapest from Moscow, he received the offer of a scholarship from Oxford where Atiyah held the Savilian Chair of Geometry. This time he was given permission and spent a year at Christ Church, Oxford, travelling there with his wife Gabriella [5]:-
By then, I said to myself, "If I ever manage to leave Hungary, I won't return." So when I arrived in Oxford, I decided to take up my old scholarship to Cambridge rather than return to Hungary. That way I didn't have to apply for anything because it had been sitting there for years. But then within a year, I got a fellowship from Trinity College, which was better than getting a PhD. There was no pressure on me whatsoever to submit for another PhD. But I thought that as the College had given me a scholarship to do a PhD, it was my duty to get one.
Let us say a little at this point about Gabriella Bollobás. She, like her husband, was born in Budapest. She worked in Hungary as an actress, musician, and singer before the family moved to England where she trained as a sculptor. She has produced busts of many famous mathematicians, for example Paul Dirac, John von Neumann, George Batchelor, Bill Tutte, and Stephen Hawking, as well as a cast bronze of David Hilbert.

The fellowship from Trinity College mentioned in the above quote was awarded to Bollobás in 1970 and, although Frank Adams became his official thesis supervisor, he found the problems from the Functional Analysis Seminar. He was awarded a second Ph.D. in 1972 for his thesis Banach Algebras and the Theory of Numerical Ranges. His main area of research, however, was in combinatorics, particularly in graph theory. Two areas of graph theory were of most interest to him. One was extremal graph theory which, in the early 1970s, was a popular area of research in Hungary but not in western Europe or in the United States. Bollobás started to write a book on the subject [5]:-
I very much wanted to show that extremal graph theory was a pretty serious subject and not only a collection of random problems that Erdős thought up and popularized. ... my aim was to show that there is such a theory - extremal graph theory. I started to write "Extremal graph theory" very soon after I arrived in Cambridge but it took me ages to finish. I had to take a sabbatical to find enough time to finish it.
In fact Extremal graph theory was published in 1978. Michael Albertson writes in a review:-
The author interprets extremal graph theory as "structural results and any relations among the invariants of a graph, especially those concerned with best possible inequalities''. Thus the content of this book is not as narrow as the title might suggest. ... This is an excellent second book in graph theory. The reviewer has on a number of occasions opened this book up to look for a specific result and been seduced into reading for hours.
The second area of graph theory which particularly interested Bollobás was random graph theory. This topic, initiated by Erdős and Rényi around 1960, began to attract world-wide attention by the early 1970s and Bollobás's interest was fired during a term that Erdős spent working with him in Cambridge on the topic. The monograph that Bollobás wrote entitled Random graphs was published in 1985. Colin McDiarmid writes in a review:-
There are many beautiful results in the theory of random graphs, and the main aim of the book is to introduce the reader to these results and to methods which prove them. ... This book is the first systematic and extensive account of a substantial body of methods and results from the theory of random graphs. It is largely self-contained, with wide coverage. It deals with probabilistic rather than enumerative approaches .... It is very well written and the material is covered in depth ... The author is a major figure who has considerably advanced the theory of random graphs, and it is fitting that he should write what will surely be the standard text.
But Bollobás was interested in graph theory not only as a research topic but also as an area which should be taught in undergraduate courses. He published Graph theory. An introductory course in 1979 and he makes clear in the preface why he wrote the textbook:-
This book is intended for the young student who is interested in graph theory and wishes to study it as part of his mathematical education. Experience at Cambridge shows that none of the currently available texts meet this need. Either they are too specialised for their audience or they lack the depth and development needed to reveal the nature of the subject. We start from the premise that graph theory is one of several courses which compete for the student's attention and should contribute to his appreciation of mathematics as a whole. Therefore, the book does not consist merely of a catalogue of results but also contains extensive descriptive passages designed to convey the flavour of the subject and to arouse the student's interest. Those theorems which are vital to the development are stated clearly, together with full and detailed proofs. The book thereby offers a leisurely introduction to graph theory which culminates in a thorough grounding in most aspects of the subject. ... Throughout this book the reader will discover connections with various other branches of mathematics, including optimization theory, linear algebra, group theory, projective geometry, representation theory, probability theory, analysis, knot theory and ring theory. Although most of these connections are not essential for an understanding of the book, the reader would benefit greatly from a modest acquaintance with these subjects.
Frank Harary, a leading researcher in graph theory, writes:-
This is an important and useful book. It contains a wealth of up-to-date material some of which is not readily available except in research papers.
The output of high quality publications from Bollobás is remarkable. As of early 2011, MathSciNet lists 433 publications by Bollobás written with 141 co-authors. We must, however, give details of his career following his appointment at the University of Cambridge in 1971. He remained at Cambridge until 1996 but he made many extended visits to the Louisiana State University at Baton Rouge. In 1996 he was offered the Jabie Hardin Chair of Excellence in Combinatorics at the Department of Mathematics of the University of Memphis, Tennessee. In fact he had been persuaded that he should take this chair by Erdős [5]:-
... we went to Memphis because my wife got absolutely fed up with Cambridge, finding it claustrophobic, and Erdős suggested that I go to Memphis, which he had visited many times, often several times a year. In Memphis I have a really wonderful job - no lecturing, no administration, a great assistant to look after me, funds to invite visitors, funds to travel, very clever and kind colleagues, an excellent gym, and so on. Although I do not have to lecture, I always give a graduate course on a topic I hope to write a book on.
However, Bollobás kept his connections with Cambridge. He retained his fellowship at Trinity College when he went to Memphis in 1996 and, since 2005, has been a Senior Research Fellow of Trinity College, Cambridge. He has received honours including election to that Hungarian Academy of Sciences and the award of the Senior Whitehead Prize by the London Mathematical Society in 2007. The citation for this award reads:-
Béla Bollobás is a world leader in combinatorics and has made fundamental contributions to almost every aspect of this huge area of mathematics. As well as all his papers, he has written a string of extraordinarily influential textbooks, many of which have had the effect of defining (or in some cases redefining) whole areas of research.
Let us look at some of his more recent books. He published the undergraduate text Linear analysis. An introductory course in 1990. Steve Abbott, reviewing the second edition (1999) of the book, writes [1]:-
Béla Bollobás writes with clarity and has clearly thought about the needs of his readers. First-time students of functional analysis will thank him for his willingness to remind them about notation and to repeat definitions that he has not used for a while. He also guides the reader by motivating the definitions and theorems. ... Bollobás has written a fine book. It is an excellent introduction to functional analysis that will be invaluable to advanced undergraduate students (and their lecturers).
In 1998 Bollobás published Modern graph theory. He writes in the Preface:-
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 mathematics, like optimization theory, group theory, matrix algebra, probability theory, logic, and knot theory.
Jerrold Grossman writes in a review:-
This well-crafted and well-written work, by one of the leading researchers and expositors in graph theory (especially extremal graph theory and random graphs), brings the author's vast knowledge, expertise, taste, and judgment to bear on an increasingly important and mainstream subject, which has long since emerged from its denigrated beginnings in the "slums of topology''. The work is full of insights ..., interpreting the material and explaining what is important, what open problems are likely to be difficult to solve (e.g., the perfect graph conjecture), and how things inter-relate (e.g., Jones polynomials of link diagrams and Tutte polynomials of graphs). We are made to feel that the author is leading us through the subject, engaging us in conversation, rather than just lecturing (for example, in the exposition of Cayley graphs).
Bollobás's two most recent books, both published in 2006, are (with Oliver Riordan) Percolation, and the single-authored work The art of mathematics. Coffee time in Memphis. The publisher, Cambridge University Press, describes this last mentioned work as follows:-
Can a Christian escape from a lion? How quickly can a rumour spread? Can you fool an airline into accepting oversize baggage? Recreational mathematics is full of frivolous questions in which the mathematician's art can be brought to bear. But play often has a purpose, whether it's bear cubs in mock fights, or war games. In mathematics, it can sharpen skills, or provide amusement, or simply surprise, and collections of problems have been the stock-in-trade of mathematicians for centuries. Two of the twentieth century's greatest players of problem posing and solving, Erdős and Littlewood, are the inspiration for this collection, which is designed to be sipped from, rather than consumed in one sitting. The questions themselves range in difficulty: the most challenging offer a glimpse of deep results that engage mathematicians today; even the easiest are capable of prompting readers to think about mathematics. All come with solutions, many with hints, and most with illustrations. Whether you are an expert, a beginner, or an amateur, this book will delight for a lifetime.
Finally, let us note that among his many distinguished research students is Imre Leader, Jonathan Partington, Luke Pebody and the Fields Medallist Timothy Gowers.

References (show)

  1. S Abbott, Review: Linear analysis: an introductory course (2nd edition) by Béla Bollobás, The Mathematical Gazette 83 (497) (1999), 365-366.
  2. R A Beezer, Review: Modern Graph Theory by Béla Bollobás, SIAM Review 41 (2) (1999), 383-384.
  3. P Diaconis, Review: Modern Graph Theory by Béla Bollobás, J. Amer. Statistical Association 95 (452) (2000), 1377-137.
  4. G R Grimmett, Review: Two Books on Random Graphs, The Annals of Probability 15 (4) (1987), 1612-1617.
  5. Y K Leong, Béla Bollobás: Graphs Extremal and Random, Newsletter of Institute for Mathematical Sciences, National University of Singapore 11 (2007), 14-21.

Additional Resources (show)

Honours (show)

Honours awarded to Béla Bollobás

  1. Lecturer at the EMS
  2. Young Researchers in Mathematics 2013

Cross-references (show)

Written by J J O'Connor and E F Robertson
Last Update March 2011