Béla Bollobás
From Wikipedia, the free encyclopedia
Béla Bollobás (born August 3, 1943 in Budapest, Hungary) is a Hungarian mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics and graph theory. His first doctorate was for work in discrete geometry in 1967, after which he spent a year in Moscow with Gelfand. After spending a year in Oxford he went to Cambridge, where in 1972 he received a Ph.D. in functional analysis.[1]
He is an external member of the Hungarian Academy of Sciences. He has been a Fellow of Trinity College, Cambridge since 1970, and is currently the Jabie Hardin Chair Professor at the University of Memphis.
He is known as an important expositor of combinatorial mathematics, on which he has written a number of books, and for spreading the combinatorial approach. His students include Tim Gowers, Fields Medal winner, and current Rouse Ball Professor of Mathematics at the University of Cambridge; Imre Leader, also professor of mathematics at Cambridge; Charles Read and Jonathan Partington, both Professors of Mathematics at the University of Leeds. He co-wrote 18 papers with Paul Erdős, giving him an Erdős number of 1.[1] He proved that the chromatic number of the random graph on n vertices is asymptotically n / 2logn.
In 2007 Bollobás was awarded the Senior Whitehead Prize by the London Mathematical Society[2].
He is also a sportsman, having represented Oxford University at modern pentathlon, and Cambridge University at fencing. His wife, Gabriella Bollobás is an accomplished sculptor and painter.
[edit] See also
- Bishop-Phelps-Bollobás theorem.
- Bollobás-Riordan polynomial.
[edit] References
- ^ Béla Bollobás at the Mathematics Genealogy Project
- ^ London Mathematical Society. List of Prizewinners. Retrieved on 2007-07-08.
[edit] External links
- Béla Bollobás 60th birthday conference, August 2003
- Béla Bollobás at the Mathematics Genealogy Project