Bela Bollobas
Affiliations: | University of Cambridge, Cambridge, England, United Kingdom | ||
| University of Memphis, Memphis, TN, United States |
Area:
MathematicsGoogle:
"Bela Bollobas"Children
Sign in to add trainee| Reinhard Diestel | grad student | 1987 | Cambridge |
| David E. Weinreich | grad student | 2000 | The University of Memphis |
| Jozsef Balogh | grad student | 2001 | The University of Memphis |
| Luke T. Pebody | grad student | 2002 | The University of Memphis |
| Jonathan D. Cutler | grad student | 2004 | The University of Memphis |
| Alice Hubenko | grad student | 2004 | The University of Memphis |
| Balazs Montagh | grad student | 2005 | The University of Memphis |
| Fabricio S. Benevides | grad student | 2011 | The University of Memphis |
| Karen R. Johannson | grad student | 2011 | The University of Memphis |
| Neal O. Bushaw | grad student | 2012 | The University of Memphis |
| Ago-Erik Riet | grad student | 2012 | The University of Memphis |
| Andrew J. Uzzell | grad student | 2012 | The University of Memphis |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Balister P, Bollobás B, Morris R, et al. (2020) Covering intervals with arithmetic progressions Acta Mathematica Hungarica. 161: 197-200 |
| Balister P, Bollobás B, Sahasrabudhe J, et al. (2019) Dense subgraphs in random graphs Discrete Applied Mathematics. 260: 66-74 |
| Balister P, Bollobás B, Lee JD, et al. (2019) A note on Linnik's Theorem on quadratic non-residues Archiv Der Mathematik. 112: 371-375 |
| Balister P, Balogh J, Bertuzzo E, et al. (2018) River landscapes and optimal channel networks. Proceedings of the National Academy of Sciences of the United States of America |
| Balister P, Bollobás B, Gunderson K, et al. (2018) Random Geometric Graphs And Isometries Of Normed Spaces Transactions of the American Mathematical Society. 370: 7361-7389 |
| Bollobás B, Riordan O. (2018) Counting dense connected hypergraphs via the probabilistic method Random Structures and Algorithms. 53: 185-220 |
| Bollobás B, Lee J, Letzter S. (2018) Eigenvalues of subgraphs of the cube European Journal of Combinatorics. 70: 125-148 |
| Bollobás B, Riordan O, Slivken E, et al. (2017) The Threshold for Jigsaw Percolation on Random Graphs Electronic Journal of Combinatorics. 24: 2-36 |
| Bollobás B, Przykucki M, Riordan O, et al. (2017) On the Maximum Running Time in Graph Bootstrap Percolation Electronic Journal of Combinatorics. 24: 2-16 |
| Balister P, Shaw A, Bollobás B, et al. (2017) Catching a fast robber on the grid Journal of Combinatorial Theory, Series A. 152: 341-352 |