Independent sets in hypergraphs J Balogh, R Morris, W Samotij Journal of the American Mathematical Society 28 (3), 669–709, 2015 | 376 | 2015 |
On the KŁR conjecture in random graphs D Conlon, WT Gowers, W Samotij, M Schacht Israel Journal of Mathematics 203 (1), 535–580, 2014 | 85 | 2014 |
Local resilience of almost spanning trees in random graphs J Balogh, B Csaba, W Samotij Random Structures & Algorithms 38 (1–2), 121–139, 2011 | 75 | 2011 |
The method of hypergraph containers J Balogh, R Morris, W Samotij arXiv preprint arXiv:1801.04584, 2018 | 70 | 2018 |
Upper tails via high moments and entropic stability M Harel, F Mousset, W Samotij Duke Mathematical Journal 171 (10), 2089-2192, 2022 | 63 | 2022 |
Optimal packings of Hamilton cycles in sparse random graphs M Krivelevich, W Samotij SIAM Journal on Discrete Mathematics 26 (3), 964–982, 2012 | 59 | 2012 |
The number of K_{s,t}-free graphs J Balogh, W Samotij Journal of the London Mathematical Society 83 (2), 368–388, 2011 | 59 | 2011 |
Large bounded degree trees in expanding graphs J Balogh, B Csaba, M Pei, W Samotij Electronic Journal of Combinatorics 17 (1), 9 pp., 2010 | 49 | 2010 |
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers Y Kohayakawa, SJ Lee, V Rödl, W Samotij Random Structures & Algorithms 46 (1), 1–25, 2015 | 48 | 2015 |
Counting independent sets in graphs W Samotij European Journal of Combinatorics 48, 5–18, 2015 | 47 | 2015 |
Counting sum-free sets in Abelian groups N Alon, J Balogh, R Morris, W Samotij Israel Journal of Mathematics 199 (1), 309–344, 2014 | 45 | 2014 |
Stability results for random discrete structures W Samotij Random Structures & Algorithms 44 (3), 269–289, 2014 | 41 | 2014 |
The typical structure of sparse K_{r+1}-free graphs J Balogh, R Morris, W Samotij, L Warnke Transactions of the American Mathematical Society 368 (9), 6439–6485, 2016 | 39* | 2016 |
On the counting problem in inverse Littlewood–Offord theory A Ferber, V Jain, K Luh, W Samotij Journal of the London Mathematical Society, 2020 | 37 | 2020 |
Corrádi and Hajnal's theorem for sparse random graphs J Balogh, C Lee, W Samotij Combinatorics, Probability and Computing 21 (1–2), 23–55, 2012 | 37 | 2012 |
Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties F Mousset, R Nenadov, W Samotij Combinatorics, Probability and Computing 29 (6), 943-955, 2020 | 36 | 2020 |
Supersaturated sparse graphs and hypergraphs A Ferber, G McKinley, W Samotij International Mathematics Research Notices 2020 (2), 378-402, 2020 | 31 | 2020 |
Exponential decay of loop lengths in the loop O(n) model with large n H Duminil-Copin, R Peled, W Samotij, Y Spinka Communications in Mathematical Physics 349 (3), 777–817, 2017 | 30 | 2017 |
Expanders are universal for the class of all spanning trees D Johannsen, M Krivelevich, W Samotij Combinatorics, Probability and Computing 22 (2), 253–281, 2013 | 30 | 2013 |
The number of K_{m,m}-free graphs J Balogh, W Samotij Combinatorica 31 (2), 131–150, 2011 | 30 | 2011 |