- Home
- Best Scientists - Mathematics
- Béla Bollobás

Mathematics

USA

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
85
Citations
35,509
544
World Ranking
66
National Ranking
39

Engineering and Technology
D-index
85
Citations
34,650
460
World Ranking
144
National Ranking
65

2023 - Research.com Mathematics in United States Leader Award

2017 - Member of Academia Europaea

2013 - Fellow of the American Mathematical Society

2013 - Polish Academy of Science

2011 - Fellow of the Royal Society, United Kingdom

- Combinatorics
- Discrete mathematics
- Geometry

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Random graph, Random regular graph and Graph. Indifference graph, 1-planar graph, Tutte polynomial, Vertex and Binary logarithm are subfields of Combinatorics in which his conducts study. As a part of the same scientific family, he mostly works in the field of Indifference graph, focusing on Chordal graph and, on occasion, Pathwidth.

His work on Discrete mathematics is being expanded to include thematically relevant topics such as Degree. His research in Random graph intersects with topics in Phase transition, Universal graph, Dense graph and Hopcroft–Karp algorithm. The various areas that Béla Bollobás examines in his Random regular graph study include Odd graph, Strongly regular graph, Pancyclic graph, Path graph and Split graph.

- Graduate Texts in Mathematics (7753 citations)
- Modern graph theory (3132 citations)
- Extremal Graph Theory (1800 citations)

Béla Bollobás mainly investigates Combinatorics, Discrete mathematics, Graph, Random graph and Percolation. His work in Random regular graph, Conjecture, Vertex, Degree and Vertex is related to Combinatorics. Hypergraph, Line graph, Indifference graph, Graph power and Chordal graph are subfields of Discrete mathematics in which his conducts study.

Béla Bollobás is interested in Bootstrap percolation, which is a field of Graph. His research in Random graph is mostly concerned with Giant component. His Percolation research is multidisciplinary, incorporating elements of Voronoi diagram and Continuum percolation theory.

- Combinatorics (98.09%)
- Discrete mathematics (67.84%)
- Graph (22.32%)

- Combinatorics (98.09%)
- Discrete mathematics (67.84%)
- Random graph (20.41%)

Béla Bollobás mostly deals with Combinatorics, Discrete mathematics, Random graph, Hypergraph and Bootstrap percolation. His work is connected to Graph, Vertex, Conjecture, Vertex and Degree, as a part of Combinatorics. His Discrete mathematics research integrates issues from Continuum percolation theory, Torus and Bounded function.

His work in Random graph addresses subjects such as Integer, which are connected to disciplines such as Finite set. His research investigates the link between Hypergraph and topics such as Probabilistic method that cross with problems in Central limit theorem and Limit. His Bootstrap percolation study incorporates themes from Extreme point, Sharpening and Percolation.

- On the stability of the Erdős-Ko-Rado theorem (45 citations)
- Monotone cellular automata in a random environment (40 citations)
- Subcritical -bootstrap percolation models have non-trivial phase transitions (34 citations)

- Combinatorics
- Geometry
- Algebra

Béla Bollobás mainly focuses on Combinatorics, Discrete mathematics, Bootstrap percolation, Percolation and Graph. All of his Combinatorics and Random graph, Integer, Disjoint sets, Kneser graph and Natural number investigations are sub-components of the entire Combinatorics study. His work in Kneser graph covers topics such as Cubic graph which are related to areas like Random regular graph, Regular graph and Extremal graph theory.

His studies deal with areas such as Continuum percolation theory and Torus as well as Discrete mathematics. Béla Bollobás works mostly in the field of Bootstrap percolation, limiting it down to topics relating to Statistical physics and, in certain cases, Type and Phase transition, as a part of the same area of interest. His study in the field of Vertex also crosses realms of Running time.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Graduate Texts in Mathematics

Rajendra Bhatia;Glen Bredon;Wolfgang Walter;Joseph J. Rotman.

**(1977)**

23307 Citations

Modern graph theory

Béla Bollobás.

**(1998)**

5518 Citations

Extremal Graph Theory

Béla Bollobás.

**(1978)**

2838 Citations

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

Béla Bollobás.

European Journal of Combinatorics **(1980)**

1518 Citations

The degree sequence of a scale-free random graph process

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

Random Structures and Algorithms **(2001)**

1148 Citations

The phase transition in inhomogeneous random graphs

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

Random Structures and Algorithms **(2007)**

898 Citations

Graph Theory: An Introductory Course

Béla Bollobás.

**(1979)**

814 Citations

The evolution of random graphs

Béla Bollobás.

Transactions of the American Mathematical Society **(1984)**

783 Citations

Graphs of Extremal Weights.

Béla Bollobás;Paul Erdös.

Ars Combinatoria **(1998)**

733 Citations

Mathematical results on scale‐free random graphs

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

**(2005)**

620 Citations

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

Contact us

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:

University of Oxford

University of Illinois at Urbana-Champaign

Uppsala University

Universidade de São Paulo

Hungarian Academy of Sciences

Tel Aviv University

Carnegie Mellon University

University of Memphis

Microsoft (United States)

University of California, Berkeley

Baidu (China)

Zhejiang University

Memorial University of Newfoundland

Aarhus University

University of Copenhagen

University of Natural Resources and Life Sciences

Hong Kong University of Science and Technology

Plant & Food Research

Mayo Clinic

University of Maryland, Baltimore

University of Tokyo

George Mason University

National Institutes of Health

Seattle Children's Hospital

Duke University

Syracuse University

Something went wrong. Please try again later.