Béla Bollobás

Publication Activity (10 Years)

Years Active: 1973-2021
Publications (10 Years): 29

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Eur. J. Comb.

Publications

József Balogh, Béla Bollobás, Bhargav P. Narayanan
Counting independent sets in regular hypergraphs. J. Comb. Theory, Ser. A 180 (2021)
Béla Bollobás, Simon Griffiths, Robert Morris, Leonardo T. Rolla, Paul Smith
Nucleation and growth in two dimensions. Random Struct. Algorithms 56 (1) (2020)
Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev
Dense subgraphs in random graphs. Discret. Appl. Math. 260 (2019)
Béla Bollobás
Making Squares - Sieves, Smooth Numbers, Cores and Random Xorsat (Keynote Speakers). AofA (2018)
Béla Bollobás, Jonathan Lee, Shoham Letzter
Eigenvalues of subgraphs of the cube. Eur. J. Comb. 70 (2018)
Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan
Line percolation. Random Struct. Algorithms 52 (4) (2018)
Paul Balister, Béla Bollobás, Imre Leader, Robert Morris
Introduction. Comb. Probab. Comput. 27 (4) (2018)
Béla Bollobás, Shoham Letzter
Longest common extension. Eur. J. Comb. 68 (2018)
Béla Bollobás, Oliver Riordan
Counting dense connected hypergraphs via the probabilistic method. Random Struct. Algorithms 53 (2) (2018)
Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters
Sentry selection in sensor networks: theory and algorithms. Int. J. Sens. Networks 24 (3) (2017)
Béla Bollobás, Oliver Riordan, Erik Slivken, Paul Smith
The Threshold for Jigsaw Percolation on Random Graphs. Electron. J. Comb. 24 (2) (2017)
Béla Bollobás, Oliver Riordan
Exploring hypergraphs with martingales. Random Struct. Algorithms 50 (3) (2017)
Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan
Catching a fast robber on the grid. J. Comb. Theory, Ser. A 152 (2017)
Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe
On the Maximum Running Time in Graph Bootstrap Percolation. Electron. J. Comb. 24 (2) (2017)
Béla Bollobás, Svante Janson, Alex Scott
Packing random graphs and hypergraphs. Random Struct. Algorithms 51 (1) (2017)
Béla Bollobás, Oliver Cooley, Mihyun Kang, Christoph Koch
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54 (4) (2017)
Béla Bollobás, Oliver Riordan
Counting Connected Hypergraphs via the Probabilistic Method. Comb. Probab. Comput. 25 (1) (2016)
Béla Bollobás, Bhargav P. Narayanan, Andrei M. Raigorodskii
On the stability of the Erdős-Ko-Rado theorem. J. Comb. Theory, Ser. A 137 (2016)
Paul Balister, Béla Bollobás, Amites Sarkar
Barrier Coverage. Random Struct. Algorithms 49 (3) (2016)
Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan
Catching a fast robber on the grid. CoRR (2016)
Paul Balister, Béla Bollobás, Karen Gunderson
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. Eur. J. Comb. 57 (2016)
Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30 (1) (2016)
Béla Bollobás, Oliver Riordan
An old approach to the giant component problem. J. Comb. Theory, Ser. B 113 (2015)
Béla Bollobás, Teeradej Kittipassorn, Bhargav P. Narayanan, Alexander D. Scott
Disjoint induced subgraphs of the same order and size. Eur. J. Comb. 49 (2015)
Béla Bollobás, Paul Smith, Andrew J. Uzzell
The time of bootstrap percolation with dense initial sets for all thresholds. Random Struct. Algorithms 47 (1) (2015)
Béla Bollobás, Alex D. Scott
Intersections of hypergraphs. J. Comb. Theory, Ser. B 110 (2015)
Béla Bollobás, Paul Smith, Andrew J. Uzzell
Monotone Cellular Automata in a Random Environment. Comb. Probab. Comput. 24 (4) (2015)
Béla Bollobás, Tom Eccles
Partial Shadows of Set Systems. Comb. Probab. Comput. 24 (5) (2015)
Béla Bollobás, Alex D. Scott
Intersections of random hypergraphs and tournaments. Eur. J. Comb. 44 (2015)
Paul Balister, Béla Bollobás
Interference percolation. Random Struct. Algorithms 44 (4) (2014)
Béla Bollobás, Gábor Kun, Imre Leader
Cops and robbers in a random graph. J. Comb. Theory, Ser. B 103 (2) (2013)
Béla Bollobás, Malte Lackmann, Dierk Schleicher
A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method. Math. Comput. 82 (281) (2013)
Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27 (1) (2013)
Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. 27 (1) (2013)
Béla Bollobás, Dieter Mitsche, Pawel Pralat
Metric Dimension for Random Graphs. Electron. J. Comb. 20 (4) (2013)
Igor Balla, Béla Bollobás, Tom Eccles
Union-closed families of sets. J. Comb. Theory, Ser. A 120 (3) (2013)
Béla Bollobás, Mykhaylo Tyomkyn
Walks and paths in trees. J. Graph Theory 70 (1) (2012)
Béla Bollobás, Vladimir Nikiforov
Degree Powers in Graphs: The Erdős-Stone Theorem. Comb. Probab. Comput. 21 (1-2) (2012)
József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao
. SIAM J. Discret. Math. 26 (4) (2012)
Paul Balister, Béla Bollobás
Critical Probabilities of 1-Independent Percolation Models. Comb. Probab. Comput. 21 (1-2) (2012)
Béla Bollobás, Oliver Riordan
Asymptotic normality of the size of the giant component via a random walk. J. Comb. Theory, Ser. B 102 (1) (2012)
József Balogh, Béla Bollobás, Robert Morris
Graph bootstrap percolation. Random Struct. Algorithms 41 (4) (2012)
Béla Bollobás, Oliver Riordan
Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms 41 (4) (2012)
József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan
Linear algebra and bootstrap percolation. J. Comb. Theory, Ser. A 119 (6) (2012)
Béla Bollobás, Oliver Riordan
. Electron. J. Comb. 19 (4) (2012)
Paul Balister, Béla Bollobás
Projections, entropy and sumsets. Comb. 32 (2) (2012)
Béla Bollobás, Svante Janson, Oliver Riordan
Monotone Graph Limits and Quasimonotone Graphs. Internet Math. 8 (3) (2012)
Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry
Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies CoRR (2011)
József Balogh, Béla Bollobás, Miklós Simonovits
The fine structure of octahedron-free graphs. J. Comb. Theory, Ser. B 101 (2) (2011)
Béla Bollobás, Alex D. Scott
Intersections of graphs. J. Graph Theory 66 (4) (2011)
Noga Alon, József Balogh, Béla Bollobás, Robert Morris
The structure of almost all graphs in a hereditary property. J. Comb. Theory, Ser. B 101 (2) (2011)
Béla Bollobás, Graham R. Brightwell, Robert Morris
Shadows of ordered graphs. J. Comb. Theory, Ser. A 118 (3) (2011)
Béla Bollobás, Svante Janson, Oliver Riordan
Sparse random graphs with clustering. Random Struct. Algorithms 38 (3) (2011)
Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks CoRR (2011)
Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky
Energy-latency tradeoff for in-network function computation in random networks. INFOCOM (2011)
Béla Bollobás, Vladimir Nikiforov
Large joints in graphs. Eur. J. Comb. 32 (1) (2011)
Béla Bollobás, Svante Janson, Oliver Riordan
On covering by translates of a set. Random Struct. Algorithms 38 (1-2) (2011)
Béla Bollobás, Imre Leader, Claudia Malvenuto
Daisies and Other Turán Problems. Comb. Probab. Comput. 20 (5) (2011)
Béla Bollobás, Oliver Riordan
Sparse graphs: Metrics and random models. Random Struct. Algorithms 39 (1) (2011)
Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
Cover-Decomposition and Polychromatic Numbers. ESA (2011)
Béla Bollobás, Vladimir Nikiforov
The number of graphs with large forbidden subgraphs. Eur. J. Comb. 31 (8) (2010)
Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters
Random majority percolation. Random Struct. Algorithms 36 (3) (2010)
Paul N. Balister, Béla Bollobás
Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36 (1) (2010)
József Balogh, Béla Bollobás, Robert Morris
Bootstrap Percolation in High Dimensions. Comb. Probab. Comput. 19 (5-6) (2010)
Béla Bollobás, Alex D. Scott
Max k-cut and judicious k-partitions. Discret. Math. 310 (15-16) (2010)
Noga Alon, Béla Bollobás
Introduction. Comb. Probab. Comput. 19 (5-6) (2010)
József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós
The unlabelled speed of a hereditary graph property. J. Comb. Theory, Ser. B 99 (1) (2009)
Béla Bollobás, Svante Janson, Oliver Riordan
Line-of-Sight Percolation. Comb. Probab. Comput. 18 (1-2) (2009)
József Balogh, Béla Bollobás, Robert Morris
Majority Bootstrap Percolation on the Hypercube. Comb. Probab. Comput. 18 (1-2) (2009)
Béla Bollobás, Oliver Riordan
Clique percolation. Random Struct. Algorithms 35 (3) (2009)
József Balogh, Béla Bollobás, Miklós Simonovits
The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34 (3) (2009)
Béla Bollobás, Boris G. Pittel
The distribution of the root degree of a random permutation. Comb. 29 (2) (2009)
Noga Alon, Béla Bollobás
Introduction. Comb. Probab. Comput. 18 (1-2) (2009)
Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters
Highly connected random geometric graphs. Discret. Appl. Math. 157 (2) (2009)
Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit
Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98 (1) (2008)
Béla Bollobás, András Gyárfás
Highly connected monochromatic subgraphs. Discret. Math. 308 (9) (2008)
Béla Bollobás, Ervin Györi
Pentagons vs. triangles. Discret. Math. 308 (19) (2008)
Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell
Eliminating Cycles in the Discrete Torus. Algorithmica 50 (4) (2008)
Paul Balister, Béla Bollobás, Stefanie Gerke
Sequences with Changing Dependencies. SIAM J. Discret. Math. 22 (3) (2008)
Paul Balister, Béla Bollobás, Stefanie Gerke
Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98 (3) (2008)
Béla Bollobás, Oliver Riordan
-fold symmetry. Random Struct. Algorithms 32 (4) (2008)
Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters
Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. 3 (3) (2008)
Béla Bollobás, Vladimir Nikiforov
Joints in graphs. Discret. Math. 308 (1) (2008)
Béla Bollobás, Vladimir Nikiforov
Graphs and Hermitian matrices: Exact interlacing. Discret. Math. 308 (20) (2008)
Béla Bollobás, Vladimir Nikiforov
Cliques and the spectral radius. J. Comb. Theory, Ser. B 97 (5) (2007)
Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan
Degree distribution of the FKP network model. Theor. Comput. Sci. 379 (3) (2007)
Béla Bollobás, Alex D. Scott
On separating systems. Eur. J. Comb. 28 (4) (2007)
Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
Maximum directed cuts in acyclic digraphs. J. Graph Theory 55 (1) (2007)
Béla Bollobás, Oliver Riordan
A note on the Harris-Kesten Theorem. Eur. J. Comb. 28 (6) (2007)
Béla Bollobás, Alex D. Scott
Separating systems and oriented graphs of diameter two. J. Comb. Theory, Ser. B 97 (2) (2007)
Béla Bollobás, Svante Janson, Oliver Riordan
The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31 (1) (2007)
Paul N. Balister, Béla Bollobás, Stefanie Gerke
The generalized Randic index of trees. J. Graph Theory 56 (4) (2007)
József Balogh, Béla Bollobás, Robert Morris
Hereditary Properties of Tournaments. Electron. J. Comb. 14 (1) (2007)
Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar
Reliable density estimates for coverage and connectivity in thin strips of finite length. MobiCom (2007)
Béla Bollobás, Svante Janson, Oliver Riordan
. Random Struct. Algorithms 31 (2) (2007)
József Balogh, Béla Bollobás, Robert Morris
Hereditary properties of combinatorial structures: Posets and oriented graphs. J. Graph Theory 56 (4) (2007)
Béla Bollobás, Andrew Thomason
Set colourings of graphs. Discret. Math. 306 (10-11) (2006)
Yair Bartal, Béla Bollobás, Manor Mendel
Ramsey-type theorems for metric spaces with applications to online problems. J. Comput. Syst. Sci. 72 (5) (2006)
Paul N. Balister, Béla Bollobás, Robert Kozma
Large deviations for mean field models of probabilistic cellular automata. Random Struct. Algorithms 29 (3) (2006)
Béla Bollobás, Graham R. Brightwell
-cliques? J. Graph Theory 52 (2) (2006)

Béla Bollobás.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Béla Bollobás