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
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.
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.
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.
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.
Modern graph theory
Extremal Graph Theory
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
European Journal of Combinatorics (1980)
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)
The phase transition in inhomogeneous random graphs
Béla Bollobás;Svante Janson;Oliver Riordan.
Random Structures and Algorithms (2007)
Graph Theory: An Introductory Course
The evolution of random graphs
Transactions of the American Mathematical Society (1984)
Graphs of Extremal Weights.
Béla Bollobás;Paul Erdös.
Ars Combinatoria (1998)
Mathematical results on scale‐free random graphs
Béla Bollobás;Béla Bollobás;Oliver M. Riordan.
If you think any of the details on this page are incorrect, let us know.
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: