Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
Marco Aurélio Cavalcanti Pacheco
Hao Mao
Peter Malec
Daniel Macclean
Longyin Wen
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
BELA BOLLOBAS
Author Info
Open Visualization
Name
Affiliation
Papers
BELA BOLLOBAS
Univ Cambridge, Dept Pure Math & Math Stat, Wilberforce Rd, Cambridge CB3 0WB, England
14
Collaborators
Citations
PageRank
27
66
12.05
Referers
Referees
References
126
65
44
Search Limit
100
126
Publications (14 rows)
Collaborators (27 rows)
Referers (100 rows)
Referees (65 rows)
Title
Citations
PageRank
Year
Nucleation and growth in two dimensions
1
0.41
2020
Packing random graphs and hypergraphs
4
0.47
2017
The threshold for jigsaw percolation on random graphs
1
0.43
2017
On the maximum running time in graph bootstrap percolation
1
0.63
2017
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
0
0.34
2016
The time of bootstrap percolation with dense initial sets for all thresholds
3
0.56
2015
Disjoint induced subgraphs of the same order and size
1
0.41
2015
Cops and robbers in a random graph
1
0.36
2013
Monotone Graph Limits And Quasimonotone Graphs
2
0.39
2012
On a conjecture involving cycle-complete graph Ramsey numbers
0
0.34
2000
Exact Face-isoperimetric Inequalities
7
2.11
1990
Isoperimetric Inequalities for Faces of the Cube and the Grid
7
1.70
1990
Hadwiger's Conjecture is True for Almost Every Graph
38
3.57
1980
The number of 1-factors in 2k-connected graphs
0
0.34
1978
1