Béla Bollobás

Q: What Schools Are Affiliated With Béla Bollobás

Béla Bollobás is affiliated with the following schools: University of Memphis, Eötvös Loránd University, University of Cambridge

Béla Bollobás's AcademicInfluence.com Rankings

Béla Bollobás

Mathematics

#63

World Rank

#188

Historical Rank

Combinatorics

World Rank

Historical Rank

Graph Theory

World Rank

Historical Rank

Measure Theory

#72

World Rank

#119

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Béla Bollobás Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Béla Bollobás FRS is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős since the age of 14.

(See a Problem?)

Béla Bollobás's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The evolution of random graphs (1984) (5154)
Random Graphs (1985) (4652)
Modern Graph Theory (2002) (2143)
Random Graphs: Notation (2001) (1587)
Extremal Graph Theory (1978) (1178)
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs (1980) (1030)
The degree sequence of a scale‐free random graph process (2001) (814)
The phase transition in inhomogeneous random graphs (2005) (724)
The Diameter of a Scale-Free Random Graph (2004) (615)
Graphs of Extremal Weights (1998) (584)
Mathematical results on scale‐free random graphs (2005) (526)
The chromatic number of random graphs (1988) (395)
Surveys in Combinatorics (1979) (393)
Directed scale-free graphs (2003) (374)
Cliques in random graphs (1976) (334)
On generalized graphs (1965) (332)
Extremal problems in graph theory (1977) (310)
Robustness and Vulnerability of Scale-Free Random Graphs (2004) (307)
Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability (1986) (286)
Random Graphs, Second Edition (2001) (285)
THE VOLUME OF CONVEX BODIES AND BANACH SPACE GEOMETRY (Cambridge Tracts in Mathematics 94) (1991) (280)
Graph theory (1979) (271)
Threshold functions (1987) (262)
Graph-theoretic parameters concerning domination, independence, and irredundance (1979) (239)
Graph Theory: An Introductory Course (2012) (230)
The Isoperimetric Number of Random Regular Graphs (1988) (215)
The scaling window of the 2‐SAT transition (1999) (206)
The Diameter of a Cycle Plus a Random Matching (1988) (188)
Random Graphs of Small Order (1985) (183)
The diameter of random regular graphs (1982) (179)
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions (2005) (178)
Edge-isoperimetric inequalities in the grid (1991) (171)
Proving integrality gaps without knowing the linear program (2002) (166)
The Diameter of Random Graphs (1981) (164)
The critical probability for random Voronoi percolation in the plane is 1/2 (2004) (158)
Threshold functions for small subgraphs (1981) (154)
List-colourings of graphs (1985) (152)
Reliable density estimates for coverage and connectivity in thin strips of finite length (2007) (150)
An Extension to the Theorem of Bishop and Phelps (1970) (150)
A polynomial of graphs on surfaces (2002) (145)
Projections of Bodies and Hereditary Properties of Hypergraphs (1995) (140)
Time-series similarity problems and well-separated geometric sets (1997) (135)
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs (1998) (135)
Degree sequences of random graphs (1981) (129)
Packings of graphs and applications to computational complexity (1978) (127)
An algorithm for finding hamilton paths and cycles in random graphs (1987) (123)
Highly linked graphs (1996) (122)
Compressions and isoperimetric inequalities (1990) (121)
The Art of Mathematics - Coffee Time in Memphis (2006) (119)
Bootstrap percolation on the hypercube (2006) (117)
Connectivity of random k-nearest-neighbour graphs (2005) (113)
Hadwiger's Conjecture is True for Almost Every Graph (1980) (113)
Problems and results on judicious partitions (2002) (111)
SETS OF INDEPENDENT EDGES OF A HYPERGRAPH (1976) (111)
Handbook of large-scale random networks (2008) (108)
Continuum percolation with steps in the square or the disc (2005) (107)
The interlace polynomial of a graph (2002) (106)
A Polynomial Invariant of Graphs On Orientable Surfaces (2001) (106)
Pentagons vs. triangles (2008) (101)
On complete subgraphs of different orders (1976) (96)
Metrics for sparse graphs (2007) (93)
Combinatorics, Probability and Computing (2006) (93)
A Tutte Polynomial for Coloured Graphs (1999) (92)
The Speed of Hereditary Properties of Graphs (2000) (92)
Sparse distance preservers and additive spanners (2003) (88)
The independence ratio of regular graphs (1981) (86)
Linear analysis : an introductory course (1990) (85)
Maximum cuts and judicious partitions in graphs without short cycles (2003) (84)
Sparse graphs: Metrics and random models (2008) (84)
Hereditary and Monotone Properties of Graphs (2013) (83)
Littlewood's Miscellany (1986) (82)
The consequences of Zipf's law for syntax and symbolic reference (2005) (81)
On a Ramsey-Turán type problem (1976) (78)
Almost every graph has reconstruction number three (1990) (78)
Bootstrap Percolation in High Dimensions (2009) (77)
Alternating Hamiltonian cycles (1976) (76)
The structure of almost all graphs in a hereditary property (2009) (76)
The interlace polynomial: a new graph polynomial (2000) (75)
Graphs which Contain all Small Graphs (1981) (75)
Exact Bounds for Judicious Partitions of Graphs (1999) (74)
Three-graphs without two triples whose symmetric difference is contained in a third (1974) (74)
Extremal graphs for weights (1999) (73)
The random-cluster model on the complete graph (1996) (72)
On separating systems (2007) (72)
The Evaluation of Random Subgraphs of the Cube (1992) (71)
The number of graphs without forbidden subgraphs (2004) (70)
Ramsey-type theorems for metric spaces with applications to online problems (2004) (69)
A Short Proof of the Harris–Kesten Theorem (2004) (69)
On the stability of the Erdős-Ko-Rado theorem (2014) (68)
An Isoperimetric Inequality on the Discrete Torus (1990) (66)
Degree distribution of the FKP network model (2003) (65)
THE ASYMPTOTIC NUMBER OF UNLABELLED REGULAR GRAPHS (1982) (65)
The longest chain among random points in Euclidean space (1988) (64)
Monotone Cellular Automata in a Random Environment (2012) (64)
Majority Bootstrap Percolation on the Hypercube (2007) (62)
Chromatic number, girth and maximal degree (1978) (62)
The Height of a Random Partial Order: Concentration of Measure (1992) (62)
Random majority percolation (2010) (61)
Cops and robbers in a random graph (2013) (59)
Sparse random graphs with clustering (2008) (59)
A Two-Variable Interlace Polynomial (2002) (58)
Graph bootstrap percolation (2011) (58)
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics (2004) (57)
Extremal graph theory with emphasis on probabilistic methods (1986) (57)
The typical structure of graphs without given excluded subgraphs (2009) (57)
The number of matchings in random regular graphs and bipartite graphs (1986) (57)
Cliques and the spectral radius (2006) (55)
Subcritical -bootstrap percolation models have non-trivial phase transitions (2013) (54)
Almost all Regular Graphs are Hamiltonian (1983) (54)
Percolation, Connectivity, Coverage and Colouring of Random Geometric Graphs (2008) (53)
Extremal Graphs without Large Forbidden Subgraphs (1978) (53)
Coupling Scale-Free and Classical Random Graphs (2004) (52)
Euler circuits and DNA sequencing by hybridization (2000) (52)
The Penultimate Rate of Growth for Graph Properties (2001) (49)
On the Structure of Edge Graphs (1973) (48)
Large deviations for mean field models of probabilistic cellular automata (2006) (48)
Distinguishing Vertices of Random Graphs (1982) (48)
Advances in graph theory (1978) (48)
On complete subgraphs of r-chromatic graphs (1975) (48)
On the structure of edge graphs ii (1976) (47)
Constrained Graph Processes (2000) (47)
The optimal structure of market areas (1972) (47)
An Erdős-Ko-Rado Theorem For Signed Sets (1997) (46)
Cycles Modulo k (1977) (46)
Sums in the grid (1996) (46)
An algorithm for finding Hamilton cycles in random graphs (1985) (45)
Linear algebra and bootstrap percolation (2011) (45)
A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems (2001) (45)
Representation of systems of measurable sets (1975) (45)
An old approach to the giant component problem (2012) (44)
LINEAR EXTENSIONS OF A RANDOM PARTIAL ORDER (1994) (43)
A jump to the bell number for hereditary graph properties (2005) (42)
Judicious Partitions of Hypergraphs (1997) (42)
The Interlace Polynomial of Graphs at - 1 (2002) (42)
Sperner Systems Consisting of Pairs of Complementary Subsets (1973) (42)
Defect Sauer Results (1995) (41)
Hermitian matrices and graphs: singular values and discrepancy (2004) (41)
The Structure of Hereditary Properties and Colourings of Random Graphs (2000) (41)
Projections, entropy and sumsets (2007) (41)
The phase transition in the uniformly grown random graph has infinite order (2005) (41)
Vertices of given degree in a random graph (1982) (41)
Uniquely colorable graphs (1978) (40)
Random Graphs and Branching Processes (2008) (40)
The Number of k-Sums Modulo k (1999) (40)
The distribution of the maximum degree of a random graph (1980) (40)
Graphs and Hermitian matrices: eigenvalue interlacing (2004) (40)
Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions (1994) (39)
Uniquely Colourable Graphs with Large Girth (1976) (38)
Contraction-Deletion Invariants for Graphs (2000) (38)
On matchings and hamiltonian cycles in random graphs Annals of Discrete Mathematics 28 (1985) (38)
The Structure of Random Graph Orders (1997) (37)
Hereditary properties of partitions, ordered graphs and ordered hypergraphs (2006) (37)
Judicious Partitions of 3-uniform Hypergraphs (2000) (37)
A critical constant for the k nearest-neighbour model (2007) (37)
Max Cut for Random Graphs with a Planted Partition (2004) (37)
Random Graphs: The Evolution of Random Graphs—the Giant Component (2001) (37)
Maximum directed cuts in acyclic digraphs (2007) (36)
Regular factors of regular graphs (1985) (36)
Judicious partitions of graphs (1993) (36)
On the Value of a Random Minimum Weight Steiner Tree (2004) (35)
Box-spaces and random partial orders (1991) (35)
Random Graphs: Preface to the Second Edition (2001) (35)
On a Conjecture of Erdos, Hajnal and Moon (1967) (35)
Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length (2007) (34)
Girth of sparse graphs (2002) (34)
Lion and man—can both win? (2009) (34)
Metric Dimension for Random Graphs (2012) (34)
Percolation on Self-Dual Polygon Configurations (2010) (34)
Cycles through specified vertices (1993) (34)
Highly connected monochromatic subgraphs (2008) (33)
The maximal number of induced complete bipartite graphs (1986) (33)
Asymptotic normality of the size of the giant component via a random walk (2010) (32)
The Diameter of Graphs: a survey (1981) (32)
Erratum to “Parallel machine scheduling with time dependent processing times” [Discrete Appl. Math. 70 (1996) 81–93] (1997) (31)
Judicious partitions of bounded‐degree graphs (2004) (31)
Dependent percolation in two dimensions (2000) (31)
Set colourings of graphs (2006) (31)
Clique percolation (2008) (31)
Continuum percolation with steps in an annulus (2004) (31)
The fine structure of octahedron-free graphs (2011) (31)
Isoperimetric inequalities and fractional set systems (1990) (31)
TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM (2015) (30)
Sharp thresholds in Bootstrap percolation (2003) (30)
Parallel sorting (1983) (30)
A Tribute to Paul Erdős: List of contributors (1990) (30)
Graphs with a small number of distinct induced subgraphs (1989) (30)
Equitable and proportional coloring of trees (1983) (30)
A problem of the theory of communication networks (1968) (30)
Graphs without large triangle free subgraphs (1991) (30)
Reverse Kleitman Inequalities (1989) (30)
Unavoidable Traces Of Set Systems (2005) (29)
Maximal matchings in graphs with given minimal and maximal degrees (1976) (29)
Walks and paths in trees (2010) (29)
On a conjecture involving cycle-complete graph Ramsey numbers (2000) (29)
Complete subgraphs are elusive (1976) (29)
First cycles in random directed graph processes (1989) (29)
Asymptotic normality of the size of the giant component in a random hypergraph (2011) (28)
Optimal Vertex Partitions (1979) (28)
Evaluations of the Circuit Partition Polynomial (2002) (28)
Volume Estimates and Rapid Mixing (1997) (28)
River landscapes and optimal channel networks (2018) (27)
Long paths in sparse random graphs (1982) (27)
Graph theory and combinatorics, 1988 : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős (1984) (26)
Game domination number (2002) (26)
Combinatorics: Random graphs (1981) (26)
The Cut Metric, Random Graphs, and Branching Processes (2009) (26)
An extremal function for the achromatic number (1991) (26)
Sorting in one round (1981) (26)
Books in graphs (2004) (26)
Percolation on random Johnson–Mehl tessellations and related models (2006) (25)
The irredundance number and maximum degree of a graph (1984) (25)
Surveys in Combinatorics 2007: Hereditary and monotone properties of combinatorial structures (2007) (25)
Some remarks on packing trees (1983) (25)
Counting Regions with Bounded Surface Area (2007) (25)
Highly connected random geometric graphs (2009) (24)
Joints in graphs (2004) (24)
A new upper bound for the list chromatic number (1989) (24)
Closure and Hamiltonian-connectivity of claw-free graphs (1999) (23)
Topological cliques of random graphs (1981) (23)
Max k-cut and judicious k-partitions (2010) (23)
Sharp thresholds and percolation in the plane (2004) (23)
The Evolution of the Cube (1983) (23)
Set Systems with few Disjoint Pairs (2003) (23)
The unlabelled speed of a hereditary graph property (2009) (22)
Introduction (2018) (22)
A Simple Branching Process Approach to the Phase Transition in Gn, p (2012) (22)
Percolation in High Dimensions (1994) (22)
On covering by translates of a set (2009) (22)
Frank Ramsey (2003) (22)
Judicious partitions of bounded-degree graphs (2004) (22)
Oriented Hamilton Cycles in Oriented Graphs (1997) (22)
Measures on monotone properties of graphs (2002) (22)
Degree Powers in Graphs with Forbidden Subgraphs (2004) (22)
Hereditary Properties of Tournaments (2007) (22)
Paths in graphs (2001) (21)
Exact Face-isoperimetric Inequalities (1990) (21)
Hereditary properties of words (2005) (21)
Cover-Decomposition and Polychromatic Numbers (2010) (21)
Graphs whose every transitive orientation contains almost every relation (1987) (21)
On some conjectures of Graffiti (1998) (21)
Linearized chord diagrams and an upper bound for vassiliev invariants (2000) (20)
Daisies and Other Turán Problems (2011) (20)
Percolation on dual lattices with k‐fold symmetry (2006) (20)
Percolation in the k-nearest neighbor graph (2008) (20)
Sorting and Graphs (1985) (20)
Probabilistic Combinatorics and Its Applications (1992) (20)
Repeated Random Insertion into a Priority Queue (1985) (20)
Clique coverings of the edges of a random graph (1993) (20)
Discrepancy in Graphs and Hypergraphs (2006) (19)
On graphs with diameter 2 (1976) (19)
Random Walks and Electrical Resistances in Products of Graphs (1997) (19)
Handbook of Large-Scale Random Networks: Bolyai Society Mathematical Studies (2009) (19)
The generalized Randić index of trees (2007) (19)
On the expected behavior of disjoint set union algorithms (1985) (18)
Integer sets with prescribed pairwise differences being distinct (2005) (18)
Geometrical Techniques for Estimating Numbers of Linear Extensions (1999) (18)
The time of bootstrap percolation with dense initial sets for all thresholds (2012) (18)
Complete Matchings in Random Subgraphs on the Cube (1990) (18)
Hereditary properties of combinatorial structures: Posets and oriented graphs (2007) (18)
Shortest paths and load scaling in scale-free trees. (2004) (18)
The Angel and the Devil in three dimensions (2006) (18)
Packing d-degenerate graphs (2008) (18)
Graphs,Groups and Matrices (1998) (18)
The maximal number of inducedr-partite subgraphs (1995) (17)
An extension of the Erdős-Stone theorem (1994) (17)
Complete subgraphs of chromatic graphs and hyper-graphs (1974) (17)
Separating systems and oriented graphs of diameter two (2007) (17)
An Extremal Problem of Graphs with Diameter 2 (1975) (17)
On Richardsons model on the hypercube (1997) (17)
Random Graphs: Models of Random Graphs (2001) (17)
Powers of Hamilton cycles in tournaments (1990) (16)
A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs (1996) (16)
Subgraph Counts and Containment Probabilities of Balanced and Unbalanced Subgraphs in a Large Random Graph a (1989) (16)
Upper bounds for the critical probability of oriented percolation in two dimensions (1993) (16)
Hamiltonian Cycles in Regular Graphs (1978) (16)
On graphs with equal edge connectivity and minimum degree (1979) (16)
Connectivity of addable graph classes (2008) (16)
The oriented cycle game (1998) (15)
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k (2000) (15)
Degree Powers in Graphs: The Erdős–Stone Theorem (2012) (15)
Weakly Pancyclic Graphs (1999) (15)
How Sharp is the Concentration of the Chromatic Number? (2004) (15)
Uniquely Partitionable Graphs (1977) (15)
Exploring hypergraphs with martingales (2014) (15)
On generalised minimal domination parameters for paths (1991) (15)
On the girth of hamiltonian weakly pancyclic graphs (1997) (15)
Helly Families of Maximal Size (1979) (15)
Long cycles in graphs with no subgraphs of minimal degree 3 (1989) (14)
Combinatorics, Geometry and Probability: On the Length of the Longest Increasing Subsequence in a Random Permutation (1997) (14)
Sentry Selection in Wireless Networks (2010) (14)
A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method (2010) (14)
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial (2001) (14)
Line-of-Sight Percolation (2007) (14)
Slow emergence of the giant component in the growing m‐out graph (2005) (14)
Isoperimetric Inequalities for Faces of the Cube and the Grid (1990) (13)
Eigenvalues of subgraphs of the cube (2016) (13)
A note on generalized chromatic number and generalized girth (1998) (13)
To Prove and Conjecture: Paul Erdos and His Mathematics (1998) (13)
Entropy along convex shapes, random tilings and shifts of finite type (2002) (13)
Regular subgraphs of random graphs (2006) (13)
The number of 2-sat functions (2003) (13)
The maximal size of the covering graph of a lattice (1979) (13)
On the Diameter and Radius of Random Subgraphs of the Cube (1994) (13)
The Optimal Arrangement of Producers (1973) (13)
Adjoining inverses to commutative Banach algebras (1973) (12)
Paths of length four (2003) (12)
Slow emergence of the giant component in the growing m-out graph (2005) (12)
Polychromatic polynomials (2000) (12)
Products of Unconditional Bodies (1995) (12)
Graphs with large maximum degree containing no odd cycles of a given length (2003) (11)
Energy-latency tradeoff for in-network function computation in random networks (2011) (11)
On the Maximum Running Time in Graph Bootstrap Percolation (2015) (11)
Catching a fast robber on the grid (2016) (11)
Colorings generated by monotone properties (1998) (11)
Spread-out percolation in R d (2007) (10)
The Phase Transition in the Erdős-Rényi Random Graph Process (2013) (10)
Connectivity Properties of Random Subgraphs of the Cube (1995) (10)
Union-closed families of sets (2013) (10)
The Numerical Range in Banach Algebras and Complex Functions of Exponential type (1971) (10)
Counting Connected Hypergraphs via the Probabilistic Method (2014) (10)
The Threshold for Jigsaw Percolation on Random Graphs (2015) (10)
Matchings and Paths in the Cube (1997) (10)
The Spatial Numerical Range and Powers of an Operator (1974) (9)
Dense subgraphs in random graphs (2018) (9)
Indestructive deletions of edges from graphs (1981) (9)
COMBINATORIAL METHODS IN DISCRETE MATHEMATICS (Encyclopedia of Mathematics and its Applications 55) (2000) (9)
Measure Graphs (9)
Monotone Graph Limits and Quasimonotone Graphs (2011) (9)
Dense neighbourhoods and Turán's theorem (1981) (9)
Cycles and semi-topological configurations (1978) (9)
Parallel Selection with High Probability (1990) (9)
Special Issue on Ramsey Theory (2003) (9)
Barrier Coverage (2016) (9)
Cops and robbers in random graphs (2008) (8)
Convex Bodies, Graphs and Partial Orders (2000) (8)
Colouring lattices (1977) (8)
Transitive Orientations of Graphs (1988) (8)
On Two Conjectures on Packing of Graphs (2005) (8)
Percolation in Voronoi tilings (2005) (8)
Generalized Chromatic Numbers of Random Graphs (1995) (8)
The number of k‐SAT functions (2003) (8)
Isoperimetric Problems for r-sets (2004) (8)
Combinatorics, geometry, and probability : a tribute to Paul Erdős (1997) (8)
The Art Of Mathematics (2006) (8)
Local and Mean Ramsey Numbers for Trees (2000) (8)
Point Arboricity Critical Graphs Exist (1975) (7)
Line percolation (2014) (7)
Intersections of graphs (2011) (7)
More rotation numbers for complete bipartite graphs (1982) (7)
Random transceiver networks (2009) (7)
Diameters of random bipartite graphs (1984) (7)
Review: László Lovász, Combinatorial problems and exercises (1981) (7)
Linear Analysis: Preface (1999) (7)
The Spectral Decomposition of Compact Hermitian Operators on Banach Spaces (1973) (7)
The cost distribution of clustering in random probing (1990) (7)
MEAN FIELD MODELS OF PROBABILISTIC CELLULAR AUTOMATA (2004) (7)
Subcritical neighbourhood family percolation models have non-trivial phase transitions (2013) (7)
Spanning Maximal Planar Subgraphs of Random Graphs (1991) (7)
Degree multiplicities and independent sets in K4-free graphs (1996) (7)
Ramsey minimal graphs (2001) (7)
Independent sets and repeated degrees (1997) (7)
Random Graphs: The Degree Sequence (2001) (7)
Graphs and Hermitian matrices: discrepancy and singular values (2004) (7)
The time of bootstrap percolation in two dimensions (2013) (7)
DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE (1977) (6)
Critical Probabilities of 1-Independent Percolation Models (2012) (6)
Jigsaw percolation on random hypergraphs (2016) (6)
Generalized duals of unconditional spaces and Lozanovskii's theorem (1993) (6)
Erratum to: Percolation on random Johnson–Mehl tessellations and related models (2009) (6)
The number of graphs with large forbidden subgraphs (2010) (6)
A Tribute to Paul Erdős: The circumference of a graph with a given minimal degree (1990) (6)
Counting Coloured Graphs of High Connectivity (1981) (6)
Probabilistic Analysis of Disjoint Set Union Algorithms (1993) (6)
Spread‐out percolation in ℝd (2005) (6)
Random graphs and covering graphs of posets (1986) (6)
A Tribute to Paul Erdős: Hamilton cycles in random graphs of minimal degree at least k (1990) (6)
Disjoint induced subgraphs of the same order and size (2013) (5)
Connectivity of random addable graphs (2009) (5)
On the Erdős covering problem: the density of the uncovered set (2021) (5)
Multicoloured extremal problems (2004) (5)
Rotation numbers for unions of circuits (1984) (5)
Packing random graphs and hypergraphs (2014) (5)
Semi-topological subgraphs (1977) (5)
The Dimension of Random Graph Orders (2013) (5)
The numerical ranges of unbounded linear operators (1975) (5)
Eliminating Cycles in the Discrete Torus (2006) (5)
The power inequality on Banach spaces (1971) (5)
Intersections of random hypergraphs and tournaments (2015) (5)
The distribution of the root degree of a random permutation (2009) (5)
Graphs and Hermitian matrices: Exact interlacing (2006) (5)
Linear Analysis by Béla Bollobás (1999) (4)
A note on long-range percolation (1992) (4)
Connectivity and dynamics for random subgraphs of the directed cube (1993) (4)
Covering intervals with arithmetic progressions (2020) (4)
A characterization of the circle and its applications to Hermitian operators (1973) (4)
Connectivity of a Gaussian network (2008) (4)
On 4-cycles in random bipartite tournaments (1983) (4)
Essentially infinite colourings of hypergraphs (2007) (4)
Weakly Saturated Graphs (1986) (4)
A Theorem in Transversal Theory (1973) (4)
Repeated Degrees in Random Uniform Hypergraphs (2013) (4)
Maximal sets of given diameter in the grid and the torus (1993) (4)
On the Best Case of Heapsort (1996) (4)
Subcritical $\mathcal{U}$-bootstrap percolation models have non-trivial phase transitions (2013) (4)
Sentry selection in sensor networks: theory and algorithms (2017) (4)
Neighbourhood family percolation (2012) (4)
Large joints in graphs (2010) (4)
Bond percolation with attenuation in high dimensional Voronoĭ tilings (2010) (4)
Random Graphs: Connectivity and Matchings (2001) (3)
On complete bipartite subgraphs contained in spanning tree complements (1983) (3)
The number of 1-factors in 2k-connected graphs (1978) (3)
The Phase Transition and Connectedness in Uniformly Grown Random Graphs (2004) (3)
Sorting in rounds (1988) (3)
Inequalities for quadratic polynomials in Hermitian and dissipative operators (1984) (3)
Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies (2011) (3)
Graphs and Groups (1979) (3)
Erdős covering systems (2020) (3)
Paul Erdős: Life and Work (2013) (3)
Counting dense connected hypergraphs via the probabilistic method (2015) (3)
The size of connected hypergraphs with prescribed covering number (1981) (3)
The Lion and the Christian, and Other Pursuit and Evasion Games (2011) (3)
Economical Covers with Geometric Applications (2003) (3)
The Art of Mathematics: Frontmatter (2006) (3)
Counting independent sets in regular hypergraphs (2020) (3)
Best possible bounds of the norms of inverses adjoined to normed algebras (1974) (3)
Cycles in Dense Graphs (1986) (3)
Partial Shadows of Set Systems (2015) (3)
Intersections of hypergraphs (2014) (3)
On a problem of Erdős and Moser (2015) (3)
Shadows of ordered graphs (2009) (2)
A lower bound for the number of non-isomorphic matroids (1969) (2)
A note on Linnik’s theorem on quadratic non-residues (2017) (2)
The Automorphism Group (2001) (2)
Paul Erdös and probability theory (1998) (2)
Essentially Infinite Colourings of Graphs (2000) (2)
Random Hypergraph Irregularity (2016) (2)
Random union-closed families (2013) (2)
A travelling salesman problem in the k-dimensional unit cube (1992) (2)
Generalized bootstrap percolation (2012) (2)
On Helly families of maximal size (1983) (2)
The algebra of bounded linear operators (1999) (2)
Self-organized development of behaviors in spatio-temporal dynamical systems (2002) (2)
An Abstract Regularity Lemma (2007) (2)
Random high-dimensional orders (1995) (2)
Turán's Theorem and Maximal Degrees (1999) (2)
Random induced graphs (2002) (2)
A note on the Harris-Kesten Theorem (2005) (2)
Long-range percolation in R^d (2005) (2)
An Extremal Problem for Polygons Inscribed in a Convex Curve (1967) (2)
Topological Phase Transitions in Spatial Networks (2018) (2)
The Size Ramsey Number of a Path (1986) (1)
Turán-Ramsey problems (1996) (1)
Geometries in finite projective and affine spaces (1979) (1)
The Speed of Bootstrap Percolation (2012) (1)
Disjointly representing set systems (2003) (1)
Normally subregular systems in normed algebras (1974) (1)
An Extension of the Erds-Stone Theorem (1994) (1)
Turán Densities of Some Hypergraphs Related to Kk+1k (2012) (1)
Pair dominating graphs (2006) (1)
Counting Boundary Paths for Oriented Percolation Clusters (1999) (1)
An Abstract Szemerédi Regularity Lemma (2008) (1)
Longest common extension (2018) (1)
Probability Theoretic Preliminaries (2001) (1)
Fast transmission in ad hoc networks (2004) (1)
Bond percolation with attenuation in high dimensional Voronoi tilings (2010) (1)
On the stability of the ErdosKoRado theorem (2015) (1)
How many graphs are unions of k-cliques? (2006) (1)
The Sum of Degrees in Cliques (2004) (1)
Minimizing the Absolute Upper Shadow (2000) (1)
The Future of Graph Theory (1993) (1)
Ramsey problems in additive number theory (1993) (1)
Large sumsets from medium-sized subsets (2022) (1)
Large sumsets from small subsets (2022) (1)
Paul Erdos and probability theory (1998) (1)
Random Graphs: The Evolution of Random Graphs—Sparse Components (2001) (1)
Graphs Extremal and Random (2010) (1)
The Trail Number of a Graph (1982) (1)
Sequences with Changing Dependencies (2008) (0)
Editorial: Issues Dedicated to Paul Erdős (1994) (0)
Continuous restrictions of linear functionals (1992) (0)
Combinatorics, Geometry and Probability: Toast to Paul Erdős (1997) (0)
Conformal invariance – Smirnov's Theorem (2006) (0)
C O ] 2 7 M ar 2 01 8 Dense Subgraphs in Random Graphs (2018) (0)
PR ] 1 4 Ju l 2 01 0 BOOTSTRAP PERCOLATION IN HIGH DIMENSIONS (2021) (0)
Extremal Graph Theory Bela Bollobas (2022) (0)
The covering of convex bodies with homothetic bodies and the illumination problem (1985) (0)
Graph Theory. Proceedings of the Conference on Graph Theory, Cambridge (1982) (0)
Linear Analysis: Weak topologies and duality (1999) (0)
Combinatorics and probability : celebrating Béla Bollobás's 60th birthday (2007) (0)
EUROPEAN JOURNAL OF COMBINATORICS JOURNAL EUROPEEN DE COMBINATOIRE EUROPAISCHE ZEITSCHRIFT FÜR KOMBINATORIK (2000) (0)
Estimating critical probabilities (2006) (0)
Random Graphs: Sorting Algorithms (2001) (0)
Projections, entropy and sumsets (2012) (0)
Some Related Problems (1985) (0)
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs (2015) (0)
On a problem of Erdös and Graham (1997) (0)
Random Graphs: Sequences, Matrices and Permutations (2001) (0)
On a problem of Erdős and Moser (2017) (0)
A Tribute to Paul Erdős: Preface (1990) (0)
Random Graphs: Long Paths and Cycles (2001) (0)
Modeling of the directed scale-free object relationships (2004) (0)
Basic concepts and results (2006) (0)
University of Birmingham Bootstrap percolation on Galton-Watson trees (2014) (0)
Lion and man—can both win? (2011) (0)
Longest common extensions (2016) (0)
Random Graphs: Cliques, Independent Sets and Colouring (2001) (0)
Partition Problems in Additive Number Theory (1996) (0)
Submitted to the Annals of Applied Probability HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS By (2010) (0)
Analytic Graph Theory (2003) (0)
Sentry Selection in Sensor Networks: A Sufficient Condition for k Single Covers (2008) (0)
Surveys in combinatorics : proceedings of the 7th British Combinatorial Conference (1979) (0)
The Tutte Polynomial (1998) (0)
ADJOINING INVERSES TO COMMUTATIVE (2010) (0)
Bond percolation on ℤ2 – the Harris–Kesten Theorem (2006) (0)
Introduction (2009) (0)
Opera and music–A mathematician’s view (2015) (0)
The time of bootstrap percolation in two dimensions (2015) (0)
The Art of Mathematics – Take Two (2022) (0)
Combinatorics, Geometry and Probability: Farewell to Paul Erdős (1997) (0)
THE PROBABILISTIC METHOD (1996) (0)
Compact normal operators (1999) (0)
Percolation: Continuum percolation (2006) (0)
Results and Problems in Combinatorial Geometry: Introduction to the English edition (1985) (0)
Tur´an densities of some hypergraphs related to K kk +1 ∗ (2013) (0)
Random Graphs: Small Subgraphs (2001) (0)
Paul Erdös at seventy-five (1989) (0)
The Maximal Number of Triangles of Maximal Perimeter Length Determined by a Finite Set (1970) (0)
Subtended angles (2015) (0)
VI.73 Godfrey Harold Hardy (2010) (0)
Linear Analysis: Basic inequalities (1999) (0)
The context of quantitative brain dynamics from psychology , biology and philosophy (2008) (0)
A strengthening of Freiman's 3k-4 theorem (2022) (0)
Paul ErdÕs at Seventy-Five (1989) (0)
Percolation: Exponential decay and critical probabilities – theorems of Menshikov and Aizenman & Barsky (2006) (0)
Covering intervals with arithmetic progressions (2019) (0)
Linear Analysis: Fixed-point theorems (1999) (0)
Flows, Connectivity and Matching (1979) (0)
Partition of a set into sets of smaller diameter (1985) (0)
Introduction (2010) (0)
Combinatorics, Geometry and Probability: Preface (1997) (0)
Paul Erdős (1913–96) (1996) (0)
The distribution of the number of vertices in the giant component (2011) (0)
Small Graphs of Large Girth (1986) (0)
Linear Analysis: Adjoint operators (1999) (0)
Combinatorics and Probability (2009) (0)
Linear Analysis: Linear functionals and the Hahn–Banach theorem (1999) (0)
Combinatorics, Geometry and Probability: Menger's Theorem for a Countable Source Set (1997) (0)
Random Geometric and Isometries Normed (2015) (0)
The number of unrelated partitions (1988) (0)
PR ] 1 6 O ct 2 00 6 Spread-out percolation in R d (2022) (0)
The Baire category theorem and the closed-graph theorem (1999) (0)
Random partial orders: concentration of the height (1992) (0)
Results and Problems in Combinatorial Geometry: Biblography (1985) (0)
Linear Analysis: Euclidean spaces and Hilbert spaces (1999) (0)
Random Walks on Graphs (1998) (0)
Subtended angles (2016) (0)
Large Graphs of Small Diameter (1986) (0)
VI.79 John Edensor Littlewood (2010) (0)
Random Graphs: Random Graphs of Small Order (2001) (0)
Linear Analysis: Continuous functions on compact spaces and the Stone–Weierstrass theorem (1999) (0)
R. E. BORCHERDS, W. T. GOWERS, M. KONTSEVICH & C. T. McMULLEN (2003) (0)
Linear Analysis: The contraction-mapping theorem (1999) (0)
Finite-dimensional normed spaces (1999) (0)
Editorial: In Honour of Paul Erdős (1993) (0)
Random Graphs: References (2001) (0)
Interference percolation (2014) (0)
Linear Analysis: Normed spaces and bounded linear operators (1999) (0)
How many graphs are unions of k‐cliques? (2006) (0)
The Oberwolfach Meeting on Combinatorics, Probability and Computing (2003) (0)
A note on Linnik’s theorem on quadratic non-residues (2019) (0)
Paul Erdõs. 26 March 1913 — 20 September 1996 (1999) (0)
Linear Analysis: Compact operators on Banach spaces (1999) (0)
C O ] 1 8 M ar 2 01 6 On a problem of Erdős and Moser (2018) (0)
Union of shadows (2003) (0)
Covering numbers for graphs and hypergraphs (2010) (0)
A ug 2 00 5 Long-range percolation in R d (2008) (0)
Spread-out percolation (2007) (0)
Percolation: Uniqueness of the infinite open cluster and critical probabilities (2006) (0)
Contents, Vol. 17, 1955 (2004) (0)
Combinatorics Probability and Computing: Introduction (2009) (0)
Making Squares - Sieves, Smooth Numbers, Cores and Random Xorsat (Keynote Speakers) (2018) (0)
Erdős covering systems (2020) (0)

This paper list is powered by the following services:

Other Resources About Béla Bollobás

en.wikipedia.org

What Schools Are Affiliated With Béla Bollobás?

Béla Bollobás is affiliated with the following schools:

Béla Bollobás's Academic­Influence.com Rankings

Why Is Béla Bollobás Influential?

Béla Bollobás's Published Works

Published Works

Other Resources About Béla Bollobás

What Schools Are Affiliated With Béla Bollobás?

Image Attributions

Béla Bollobás's AcademicInfluence.com Rankings