Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBéla Bollobás
Person information
- affiliation: University of Cambridge, UK
- award (2017): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j271]József Balogh, Béla Bollobás, Bhargav P. Narayanan:
Counting independent sets in regular hypergraphs. J. Comb. Theory, Ser. A 180: 105405 (2021)- 2020
- [j270]Béla Bollobás, Simon Griffiths, Robert Morris, Leonardo T. Rolla
, Paul Smith:
Nucleation and growth in two dimensions. Random Struct. Algorithms 56(1): 63-96 (2020)
2010 – 2019
- 2019
- [j269]Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev:
Dense subgraphs in random graphs. Discret. Appl. Math. 260: 66-74 (2019) - 2018
- [j268]Paul Balister, Béla Bollobás, Imre Leader, Robert Morris:
Introduction. Comb. Probab. Comput. 27(4): 441 (2018) - [j267]Béla Bollobás, Shoham Letzter:
Longest common extension. Eur. J. Comb. 68: 242-248 (2018) - [j266]Béla Bollobás, Jonathan Lee, Shoham Letzter:
Eigenvalues of subgraphs of the cube. Eur. J. Comb. 70: 125-148 (2018) - [j265]Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan:
Line percolation. Random Struct. Algorithms 52(4): 597-616 (2018) - [j264]Béla Bollobás, Oliver Riordan:
Counting dense connected hypergraphs via the probabilistic method. Random Struct. Algorithms 53(2): 185-220 (2018) - [c18]Béla Bollobás:
Making Squares - Sieves, Smooth Numbers, Cores and Random Xorsat (Keynote Speakers). AofA 2018: 3:1-3:1 - 2017
- [j263]Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe:
On the Maximum Running Time in Graph Bootstrap Percolation. Electron. J. Comb. 24(2): 2 (2017) - [j262]Béla Bollobás, Oliver Riordan, Erik Slivken, Paul Smith:
The Threshold for Jigsaw Percolation on Random Graphs. Electron. J. Comb. 24(2): 2 (2017) - [j261]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): 139-148 (2017) - [j260]Béla Bollobás, Oliver Cooley, Mihyun Kang, Christoph Koch:
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54(4): 1261-1277 (2017) - [j259]Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. J. Comb. Theory, Ser. A 152: 341-352 (2017) - [j258]Béla Bollobás, Oliver Riordan:
Exploring hypergraphs with martingales. Random Struct. Algorithms 50(3): 325-352 (2017) - [j257]Béla Bollobás, Svante Janson, Alex Scott:
Packing random graphs and hypergraphs. Random Struct. Algorithms 51(1): 3-13 (2017) - 2016
- [j256]Béla Bollobás, Oliver Riordan:
Counting Connected Hypergraphs via the Probabilistic Method. Comb. Probab. Comput. 25(1): 21-75 (2016) - [j255]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: 85-93 (2016) - [j254]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: 64-78 (2016) - [j253]Paul Balister, Béla Bollobás, Amites Sarkar:
Barrier Coverage. Random Struct. Algorithms 49(3): 429-478 (2016) - [j252]Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30(1): 465-473 (2016) - [i4]Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. CoRR abs/1609.01002 (2016) - 2015
- [j251]Béla Bollobás, Paul Smith, Andrew J. Uzzell:
Monotone Cellular Automata in a Random Environment. Comb. Probab. Comput. 24(4): 687-722 (2015) - [j250]Béla Bollobás, Tom Eccles:
Partial Shadows of Set Systems. Comb. Probab. Comput. 24(5): 825-828 (2015) - [j249]Béla Bollobás, Alex D. Scott:
Intersections of random hypergraphs and tournaments. Eur. J. Comb. 44: 125-139 (2015) - [j248]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: 153-166 (2015) - [j247]Béla Bollobás, Alex D. Scott:
Intersections of hypergraphs. J. Comb. Theory, Ser. B 110: 180-208 (2015) - [j246]Béla Bollobás, Oliver Riordan:
An old approach to the giant component problem. J. Comb. Theory, Ser. B 113: 236-260 (2015) - [j245]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): 1-29 (2015) - 2014
- [j244]Paul Balister, Béla Bollobás:
Interference percolation. Random Struct. Algorithms 44(4): 399-418 (2014) - [p5]Béla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader:
A coding problem for pairs of subsets. Geometry, Structure and Randomness in Combinatorics 2014: 47-59 - 2013
- [j243]Béla Bollobás, Dieter Mitsche, Pawel Pralat:
Metric Dimension for Random Graphs. Electron. J. Comb. 20(4): 1 (2013) - [j242]Béla Bollobás, Gábor Kun, Imre Leader:
Cops and robbers in a random graph. J. Comb. Theory, Ser. B 103(2): 226-236 (2013) - [j241]Igor Balla, Béla Bollobás, Tom Eccles:
Union-closed families of sets. J. Comb. Theory, Ser. A 120(3): 531-544 (2013) - [j240]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): 443-457 (2013) - [j239]Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27(1): 145-154 (2013) - [j238]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. 27(1): 240-256 (2013) - [p4]Béla Bollobás:
Paul Erdős: Life and Work. The Mathematics of Paul Erdős I 2013: 1-41 - [p3]Béla Bollobás, Graham R. Brightwell:
The Dimension of Random Graph Orders. The Mathematics of Paul Erdős II 2013: 47-68 - [p2]Béla Bollobás, Andrew Thomason:
Hereditary and Monotone Properties of Graphs. The Mathematics of Paul Erdős II 2013: 69-80 - 2012
- [j237]Paul Balister, Béla Bollobás:
Projections, entropy and sumsets. Comb. 32(2): 125-141 (2012) - [j236]Béla Bollobás, Oliver Riordan:
A Simple Branching Process Approach to the Phase Transition in Gn, p. Electron. J. Comb. 19(4): 21 (2012) - [j235]Paul Balister, Béla Bollobás:
Critical Probabilities of 1-Independent Percolation Models. Comb. Probab. Comput. 21(1-2): 11-22 (2012) - [j234]Béla Bollobás, Vladimir Nikiforov:
Degree Powers in Graphs: The Erdős-Stone Theorem. Comb. Probab. Comput. 21(1-2): 89-105 (2012) - [j233]Béla Bollobás, Svante Janson, Oliver Riordan:
Monotone Graph Limits and Quasimonotone Graphs. Internet Math. 8(3): 187-231 (2012) - [j232]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): 53-61 (2012) - [j231]József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan:
Linear algebra and bootstrap percolation. J. Comb. Theory, Ser. A 119(6): 1328-1335 (2012) - [j230]Béla Bollobás, Mykhaylo Tyomkyn:
Walks and paths in trees. J. Graph Theory 70(1): 54-66 (2012) - [j229]József Balogh, Béla Bollobás, Robert Morris:
Graph bootstrap percolation. Random Struct. Algorithms 41(4): 413-440 (2012) - [j228]Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms 41(4): 441-450 (2012) - [j227]József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao:
Turán Densities of Some Hypergraphs Related to Kk+1k. SIAM J. Discret. Math. 26(4): 1609-1617 (2012) - 2011
- [b5]Béla Bollobás:
Random Graphs, Second Edition. Cambridge Studies in Advanced Mathematics 73, Cambridge University Press 2011, ISBN 978-0-51181406-8, pp. 1-498 - [j226]Béla Bollobás, Imre Leader, Claudia Malvenuto:
Daisies and Other Turán Problems. Comb. Probab. Comput. 20(5): 743-747 (2011) - [j225]Béla Bollobás, Vladimir Nikiforov:
Large joints in graphs. Eur. J. Comb. 32(1): 33-44 (2011) - [j224]József Balogh, Béla Bollobás, Miklós Simonovits:
The fine structure of octahedron-free graphs. J. Comb. Theory, Ser. B 101(2): 67-84 (2011) - [j223]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): 85-110 (2011) - [j222]Béla Bollobás, Graham R. Brightwell, Robert Morris:
Shadows of ordered graphs. J. Comb. Theory, Ser. A 118(3): 729-747 (2011) - [j221]Béla Bollobás, Alex D. Scott:
Intersections of graphs. J. Graph Theory 66(4): 261-282 (2011) - [j220]Béla Bollobás, Svante Janson, Oliver Riordan:
On covering by translates of a set. Random Struct. Algorithms 38(1-2): 33-67 (2011) - [j219]Béla Bollobás, Svante Janson, Oliver Riordan:
Sparse random graphs with clustering. Random Struct. Algorithms 38(3): 269-323 (2011) - [j218]Béla Bollobás, Oliver Riordan:
Sparse graphs: Metrics and random models. Random Struct. Algorithms 39(1): 1-38 (2011) - [c17]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. ESA 2011: 799-810 - [c16]Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky:
Energy-latency tradeoff for in-network function computation in random networks. INFOCOM 2011: 1575-1583 - [i3]Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky:
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks. CoRR abs/1101.0858 (2011) - [i2]Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry:
Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies. CoRR abs/1103.5957 (2011) - 2010
- [j217]Noga Alon, Béla Bollobás:
Introduction. Comb. Probab. Comput. 19(5-6): 641 (2010) - [j216]József Balogh, Béla Bollobás, Robert Morris:
Bootstrap Percolation in High Dimensions. Comb. Probab. Comput. 19(5-6): 643-692 (2010) - [j215]Béla Bollobás, Alex D. Scott:
Max k-cut and judicious k-partitions. Discret. Math. 310(15-16): 2126-2139 (2010) - [j214]Béla Bollobás, Vladimir Nikiforov:
The number of graphs with large forbidden subgraphs. Eur. J. Comb. 31(8): 1964-1968 (2010) - [j213]Paul N. Balister, Béla Bollobás:
Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36(1): 5-10 (2010) - [j212]Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters:
Random majority percolation. Random Struct. Algorithms 36(3): 315-340 (2010)
2000 – 2009
- 2009
- [j211]Béla Bollobás, Boris G. Pittel:
The distribution of the root degree of a random permutation. Comb. 29(2): 131-151 (2009) - [j210]Noga Alon, Béla Bollobás:
Introduction. Comb. Probab. Comput. 18(1-2): 1 (2009) - [j209]József Balogh, Béla Bollobás, Robert Morris:
Majority Bootstrap Percolation on the Hypercube. Comb. Probab. Comput. 18(1-2): 17-51 (2009) - [j208]Béla Bollobás, Svante Janson, Oliver Riordan:
Line-of-Sight Percolation. Comb. Probab. Comput. 18(1-2): 83-106 (2009) - [j207]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Highly connected random geometric graphs. Discret. Appl. Math. 157(2): 309-320 (2009) - [j206]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): 9-19 (2009) - [j205]József Balogh, Béla Bollobás, Miklós Simonovits:
The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34(3): 305-318 (2009) - [j204]Béla Bollobás, Oliver Riordan:
Clique percolation. Random Struct. Algorithms 35(3): 294-322 (2009) - 2008
- [j203]Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus. Algorithmica 50(4): 446-454 (2008) - [j202]Béla Bollobás, Vladimir Nikiforov:
Joints in graphs. Discret. Math. 308(1): 9-19 (2008) - [j201]Béla Bollobás, András Gyárfás:
Highly connected monochromatic subgraphs. Discret. Math. 308(9): 1722-1725 (2008) - [j200]Béla Bollobás, Ervin Györi:
Pentagons vs. triangles. Discret. Math. 308(19): 4332-4336 (2008) - [j199]Béla Bollobás, Vladimir Nikiforov:
Graphs and Hermitian matrices: Exact interlacing. Discret. Math. 308(20): 4816-4821 (2008) - [j198]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. 3(3): 204-213 (2008) - [j197]Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit:
Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98(1): 85-94 (2008) - [j196]Paul Balister, Béla Bollobás, Stefanie Gerke:
Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98(3): 577-584 (2008) - [j195]Béla Bollobás, Oliver Riordan:
Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008) - [j194]Paul Balister, Béla Bollobás, Stefanie Gerke:
Sequences with Changing Dependencies. SIAM J. Discret. Math. 22(3): 1149-1154 (2008) - 2007
- [j193]József Balogh, Béla Bollobás, Robert Morris:
Hereditary Properties of Tournaments. Electron. J. Comb. 14(1) (2007) - [j192]Béla Bollobás, Alex D. Scott:
On separating systems. Eur. J. Comb. 28(4): 1068-1071 (2007) - [j191]Béla Bollobás, Oliver Riordan:
A note on the Harris-Kesten Theorem. Eur. J. Comb. 28(6): 1720-1723 (2007) - [j190]Béla Bollobás, Alex D. Scott:
Separating systems and oriented graphs of diameter two. J. Comb. Theory, Ser. B 97(2): 193-203 (2007) - [j189]Béla Bollobás, Vladimir Nikiforov:
Cliques and the spectral radius. J. Comb. Theory, Ser. B 97(5): 859-865 (2007) - [j188]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): 1-13 (2007) - [j187]Paul N. Balister, Béla Bollobás, Stefanie Gerke:
The generalized Randic index of trees. J. Graph Theory 56(4): 270-286 (2007) - [j186]József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of combinatorial structures: Posets and oriented graphs. J. Graph Theory 56(4): 311-332 (2007) - [j185]Béla Bollobás, Svante Janson, Oliver Riordan:
The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007) - [j184]Béla Bollobás, Svante Janson, Oliver Riordan:
Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007) - [j183]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): 306-316 (2007) - [c15]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: 75-86 - 2006
- [b4]Béla Bollobás, Oliver Riordan:
Percolation. Cambridge University Press 2006, ISBN 978-0-521-87232-4, pp. I-X, 1-323 - [b3]Béla Bollobás:
The Art of Mathematics - Coffee Time in Memphis. Cambridge University Press 2006, ISBN 978-0-521-69395-0, pp. I-XIV, 1-370 - [j182]Béla Bollobás, Andrew Thomason:
Set colourings of graphs. Discret. Math. 306(10-11): 948-952 (2006) - [j181]Paul N. Balister, Béla Bollobás:
Pair dominating graphs. Eur. J. Comb. 27(2): 322-328 (2006) - [j180]József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of partitions, ordered graphs and ordered hypergraphs. Eur. J. Comb. 27(8): 1263-1281 (2006) - [j179]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): 890-921 (2006) - [j178]Béla Bollobás, Imre Leader:
The Angel and the Devil in three dimensions. J. Comb. Theory, Ser. A 113(1): 176-184 (2006) - [j177]Béla Bollobás, Graham R. Brightwell:
How many graphs are unions of k-cliques? J. Graph Theory 52(2): 87-107 (2006) - [j176]Béla Bollobás, Jeong Han Kim, Jacques Verstraëte:
Regular subgraphs of random graphs. Random Struct. Algorithms 29(1): 1-13 (2006) - [j175]Paul N. Balister, Béla Bollobás, Robert Kozma:
Large deviations for mean field models of probabilistic cellular automata. Random Struct. Algorithms 29(3): 399-415 (2006) - [j174]Béla Bollobás, Oliver Riordan:
Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006) - [j173]Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis:
Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. 2(2): 19-51 (2006) - [c14]Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus. LATIN 2006: 202-210 - 2005
- [j172]Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman:
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions. Biol. Cybern. 92(6): 367-379 (2005) - [j171]József Balogh, Béla Bollobás:
Unavoidable Traces Of Set Systems. Comb. 25(6): 633-643 (2005) - [j170]Béla Bollobás, Vladimir Nikiforov:
The Sum of Degrees in Cliques. Electron. J. Comb. 12 (2005) - [j169]Béla Bollobás, Vladimir Nikiforov:
Books in graphs. Eur. J. Comb. 26(2): 259-270 (2005) - [j168]Béla Bollobás, Oleg Pikhurko:
Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. 26(5): 607-616 (2005) - [j167]József Balogh, Béla Bollobás:
Hereditary properties of words. RAIRO Theor. Informatics Appl. 39(1): 49-65 (2005) - [j166]József Balogh, Béla Bollobás, David Weinreich:
A jump to the bell number for hereditary graph properties. J. Comb. Theory, Ser. B 95(1): 29-48 (2005) - [j165]Béla Bollobás, Svante Janson, Oliver Riordan:
The phase transition in the uniformly grown random graph has infinite order. Random Struct. Algorithms 26(1-2): 1-36 (2005) - [j164]