World's Best Scientists 2026 revealed!
Award Badge
Engineering and Technology
USA
2026
Award Badge
Mathematics
USA
2026

D-Index & Metrics

Mathematics

D-Index
94
Citations
47445
World Ranking
58
National Ranking
38

Engineering and Technology

D-Index
94
Citations
46230
World Ranking
205
National Ranking
75

Research.com Recognitions

  • 2026 - Research.com Engineering and Technology in United States Leader Award
  • 2026 - Research.com Mathematics in United States Leader Award
  • 2025 - Research.com Engineering and Technology in United States Leader Award
  • 2025 - Research.com Mathematics in United States Leader Award
  • 2017 - Member of Academia Europaea
  • 2013 - Polish Academy of Science
  • 2013 - Fellow of the American Mathematical Society
  • 2011 - Fellow of the Royal Society, United Kingdom

Overview

Béla Bollobás is affiliated with the University of Memphis in the United States. Their research spans multiple areas within mathematics and computer science, focusing particularly on discrete mathematics and combinatorics as well as computational theory and mathematics. Their scholarly output includes work in main fields such as Mathematics and Computer Science.

The scientist has contributed to several subfields of mathematics, including:

  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Geometry and Topology
  • Mathematical Physics
  • Algebra and Number Theory

The main topics of their work cover a diverse range of mathematical and computational themes. These include:

  • Limits and Structures in Graph Theory
  • Analytic Number Theory Research
  • Cellular Automata and Applications
  • Stochastic processes and statistical mechanics
  • Markov Chains and Monte Carlo Methods
  • Advanced Topology and Set Theory
  • Graph Labeling and Dimension Problems

Among recent academic papers authored or coauthored by Bollobás are:

  • "Universality for two-dimensional critical cellular automata" (2022, Proceedings of the London Mathematical Society)
  • "Subcritical monotone cellular automata" (2023, Random Structures and Algorithms)
  • "On the Erdős covering problem: the density of the uncovered set" (2021, Inventiones mathematicae)
  • "Flat Littlewood polynomials exist" (2020, Annals of Mathematics)
  • "The critical length for growing a droplet" (2022, arXiv [Cornell University])

Béla Bollobás frequently collaborates with other researchers, including:

  • Paul Balister
  • Robert Morris
  • Marius Tiba
  • Imre Leader
  • Julian Sahasrabudhe

Their work has been published in several academic venues, among which are:

  • arXiv (Cornell University)
  • Journal of the European Mathematical Society
  • Proceedings of the London Mathematical Society
  • Random Structures and Algorithms
  • Inventiones mathematicae

Béla Bollobás has authored a book published by Cambridge University Press titled The Art of Mathematics - Take Two, released in 2022.

The scientist has received recognition in the form of memberships and fellowships including:

  • Member of Academia Europaea (2017)
  • Polish Academy of Science (2013)
  • Fellow of the American Mathematical Society (2013)
  • Fellow of the Royal Society, United Kingdom (2011)

Best Publications

  • Random Graphs

    Unknown

  • Modern graph theory

    Béla Bollobás

  • Extremal Graph Theory

    Béla Bollobás

  • A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs

    Béla Bollobás

  • The degree sequence of a scale-free random graph process

    Béla Bollobás;Oliver Riordan;Joel Spencer;Gábor Tusnády

  • The phase transition in inhomogeneous random graphs

    Béla Bollobás;Svante Janson;Oliver Riordan

  • The Diameter of a Scale-Free Random Graph

    Bélaa Bollobás;Oliver Riordan

  • Graphs of Extremal Weights.

    Béla Bollobás;Paul Erdös

  • The evolution of random graphs

    Béla Bollobás

  • Graph Theory: An Introductory Course

    Béla Bollobás

  • Mathematical results on scale‐free random graphs

    Béla Bollobás;Béla Bollobás;Oliver M. Riordan

  • The chromatic number of random graphs

    Béla Bollobás

  • On generalized graphs

    B. Bollobás

  • Cliques in random graphs

    B. Bollobas;P. Erdös

  • Directed scale-free graphs

    Béla Bollobás;Christian Borgs;Jennifer Chayes;Oliver Riordan

  • Random Graphs: Second Edition

    Béla Bollobás

  • Robustness and Vulnerability of Scale-Free Random Graphs

    Béla Bollobás;Oliver Riordan

  • Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability

    Béla Bollobás

  • Threshold functions

    Unknown

  • Graph‐theoretic parameters concerning domination, independence, and irredundance

    Béla Bollobás;Ernest J. Cockayne

  • THE VOLUME OF CONVEX BODIES AND BANACH SPACE GEOMETRY (Cambridge Tracts in Mathematics 94)

    Béla Bollobás

  • The phase transition in inhomogeneous random graphs

    Bela Bollobas;Svante Janson;Oliver Riordan

  • Extremal problems in graph theory

    Béla Bollobás

Frequent Co-Authors

Paul Balister
Paul Balister University of Oxford
Oliver Riordan
Oliver Riordan University of Oxford
József Balogh
József Balogh University of Illinois at Urbana-Champaign
Graham Brightwell
Graham Brightwell London School of Economics and Political Science
Andrew Thomason
Andrew Thomason University of Cambridge
Svante Janson
Svante Janson Uppsala University
Yoshiharu Kohayakawa
Yoshiharu Kohayakawa Universidade de São Paulo
Paul Erdös
Paul Erdös Hungarian Academy of Sciences
Alan Frieze
Alan Frieze Carnegie Mellon University
Noga Alon
Noga Alon Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in mathematics, exploring related online degrees can open diverse and lucrative career pathways. An ms in data analytics is a popular option, combining mathematical expertise with data science skills to meet growing industry demands. This degree equips graduates to analyze complex datasets and drive strategic decisions across sectors.

For those looking to blend business acumen with technical skills, pursuing an MBA is a strategic choice. Discovering the easiest mba programs to get into can simplify the admissions process, helping students quickly enhance their leadership capabilities without compromising quality.

Additionally, the rise of flexible learning has popularized the easiest mba online options. These programs offer convenience and accessibility, making it easier for working professionals to balance education with other commitments while advancing their careers.

For experienced professionals seeking top executive roles, pursuing one of the online dba programs provides advanced leadership training combined with practical research skills. These affordable, flexible programs offer a pathway to senior management and academic positions alike.

Best Scientists Citing Béla Bollobás

Trending Scientists