Követés
Jozsef Balogh
Jozsef Balogh
E-mail megerősítve itt: illinois.edu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
On k-coverage in a mostly sleeping sensor network
S Kumar, TH Lai, J Balogh
Proceedings of the 10th annual international conference on Mobile computing …, 2004
9422004
Independent sets in hypergraphs
J Balogh, R Morris, W Samotij
Journal of the American Mathematical Society 28 (3), 669-709, 2015
3602015
The sharp threshold for bootstrap percolation in all dimensions
J Balogh, B Bollobás, H Duminil-Copin, R Morris
Transactions of the American Mathematical Society 364 (5), 2667-2701, 2012
2162012
Bootstrap percolation on the random regular graph
J Balogh, BG Pittel
Random Structures & Algorithms 30 (1‐2), 257-286, 2007
2112007
Bootstrap percolation on the hypercube
J Balogh, B Bollobás
Probability Theory and Related Fields 134, 624-648, 2006
1552006
The speed of hereditary properties of graphs
J Balogh, B Bollobás, D Weinreich
Journal of Combinatorial Theory, Series B 79 (2), 131-156, 2000
1262000
Bootstrap percolation on infinite trees and non-amenable groups
J Balogh, Y Peres, G Pete
Combinatorics, Probability and Computing 15 (5), 715-730, 2006
1222006
Bootstrap percolation in three dimensions
J Balogh, B Bollobás, R Morris
1202009
Random disease on the square grid
J Balogh, G Pete
Random Structures & Algorithms 13 (3‐4), 409-422, 1998
1161998
The number of edge colorings with no monochromatic cliques
N Alon, J Balogh, P Keevash, B Sudakov
Journal of the London Mathematical Society 70 (2), 273-288, 2004
982004
The number of graphs without forbidden subgraphs
J Balogh, B Bollobás, M Simonovits
Journal of Combinatorial Theory, Series B 91 (1), 1-24, 2004
922004
Bootstrap percolation in high dimensions
J Balogh, B Bollobás, R Morris
Combinatorics, Probability and Computing 19 (5-6), 643-692, 2010
892010
The structure of almost all graphs in a hereditary property
N Alon, J Balogh, B Bollobás, R Morris
Journal of Combinatorial Theory, Series B 101 (2), 85-110, 2011
822011
Majority bootstrap percolation on the hypercube
J Balogh, B Bollobás, R Morris
Combinatorics, Probability and Computing 18 (1-2), 17-51, 2009
762009
Local resilience of almost spanning trees in random graphs
J Balogh, B Csaba, W Samotij
Random Structures & Algorithms 38 (1‐2), 121-139, 2011
722011
Graph bootstrap percolation
J Balogh, B Bollobás, R Morris
Random Structures & Algorithms 41 (4), 413-440, 2012
712012
The method of hypergraph containers
J Balogh, R Morris, W Samotij
Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018
652018
Upper bounds on the size of 4-and 6-cycle-free subgraphs of the hypercube
J Balogh, P Hu, B Lidický, H Liu
European Journal of Combinatorics 35, 75-85, 2014
652014
The typical structure of graphs without given excluded subgraphs
J Balogh, B Bollobás, M Simonovits
Random Structures & Algorithms 34 (3), 305-318, 2009
632009
The penultimate rate of growth for graph properties
J Balogh, B Bollobás, D Weinreich
European Journal of Combinatorics 22 (3), 277-289, 2001
612001
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20