Béla Bollobás

Béla Bollobás

Infobox Scientist
box_width =
name = Béla Bollobás


image_size =
caption =
birth_date = Birth date and age|1943|8|3
birth_place = Budapest, Hungary
death_date =
death_place =
residence =
citizenship =
nationality =
ethnicity =
fields = Mathematics
workplaces = University of Memphis
alma_mater = University of Cambridge
doctoral_advisor =
academic_advisors =
doctoral_students =
notable_students = Tim Gowers
Imre Leader
Charles Read
Jonathan Partington
known_for = Functional analysis, combinatorics, graph theory
author_abbrev_bot =
author_abbrev_zoo =
influences =
influenced =
awards = Senior Whitehead Prize (2007)
religion =


footnotes =

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. [MathGenealogy|id=22719]

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. [ [http://www.oakland.edu/enp/Erdos0 Erdos0, Version 2007, February 28, 2007] ]

He proved several results on random graphs, e.g., that the chromatic number of the random graph on "n" vertices is asymptotically n/2log n. Also, he established a large number of theorems on extremal problems of set systems, as an example, he proved first what became later known as the LYM inequality.

In 2007 Bollobás was awarded the Senior Whitehead Prize by the London Mathematical Society [cite web
url = http://www.lms.ac.uk/activities/prizes_com/pastwinners.html#swhitehead
title = List of Prizewinners
author = London Mathematical Society
accessdate = 2007-07-08
] .

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.

References

External links

* [http://www.dpmms.cam.ac.uk/belabash/ Béla Bollobás 60th birthday conference, August 2003]
*MathGenealogy|id=22719
* [http://bollobas.com/ Homepage]

Persondata
NAME= Bollobás, Béla
ALTERNATIVE NAMES=
SHORT DESCRIPTION=Hungarian mathematician
DATE OF BIRTH= August 3, 1943
PLACE OF BIRTH= Budapest, Hungary
DATE OF DEATH=
PLACE OF DEATH=


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Béla Bollobás — (* 3. August 1943 in Budapest) ist ein ungarisch britischer Mathematiker, der sich mit Graphentheorie, Kombinatorik, Perkolationstheorie und Funktionalanalysis beschäftigt …   Deutsch Wikipedia

  • Béla Bollobás — Béla Bollobás, né le 3 août 1943 à Budapest (Hongrie), est un mathématicien hongrois qui a travaillé dans des domaines variés des mathématiques, comprenant l analyse fonctionnelle, la combinatoire et la théorie des graphes. Il reçut le… …   Wikipédia en Français

  • Béla Bollobás — Saltar a navegación, búsqueda Béla Bollobás (nacido el 3 de agosto de 1943 en Budapest) es un matematico húngaro. Su primer doctorado fue por un trabajo sobre geometría discreta en 1967, después de lo cual paso un año en Moscú con Israil Gelfand …   Wikipedia Español

  • Béla — ist ein männlicher Vorname. Inhaltsverzeichnis 1 Herkunft und Bedeutung 2 Namenstag 3 Varianten 4 Bekannte Namensträger …   Deutsch Wikipedia

  • Béla — may refer to:* Béla I of Hungary * Béla II of Hungary * Béla III of Hungary * Béla IV of Hungary * Béla Bartók, Hungarian composer * Béla Bollobás, Hungarian mathematician * Béla Fleck, American banjo player * Béla Károlyi, Romanian gymnastics… …   Wikipedia

  • Erdős–Stone theorem — In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán s theorem to bound the number of edges in an H free graph for a non complete graph H . It is named after Paul Erdős and Arthur Stone, who proved it in… …   Wikipedia

  • Hadwigers Vermutung — Der K4 als Minor eines Graphen, für dessen Färbung k = 4 Farben benötigt werden. In der Graphentheorie stellt die Vermutung von Hadwiger einen Zusammenhang zwischen Färbbarkeit von Graphen und dem Vorkommen vollständiger Minoren her. Ihre Aussage …   Deutsch Wikipedia

  • Luke Pebody — Luke Thomas Pebody (born 1977) is a mathematician who solved the necklace problem. Educated at Rugby School, Luke Pebody was admitted to Cambridge University at the age of 14 to read mathematics. He went up when he was 16, making him one of the… …   Wikipedia

  • Problema del ángel — Saltar a navegación, búsqueda La región azul de puntos indica a dónde podría ir un ángel de poder 3. El problema del ángel es un problema perteneciente a la Teoría de Juegos, propuesto por John Horton Conway.[1 …   Wikipedia Español

  • Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”