Finding a large hidden clique in a random graph N Alon, M Krivelevich, B Sudakov Random Structures & Algorithms 13 (3‐4), 457-466, 1998 | 510 | 1998 |
Pseudo-random graphs M Krivelevich, B Sudakov More sets, graphs and numbers: A Salute to Vera Sos and András Hajnal, 199-262, 2006 | 447 | 2006 |
Acyclic edge colorings of graphs N Alon, B Sudakov, A Zaks Journal of Graph Theory 37 (3), 157-167, 2001 | 237 | 2001 |
The largest eigenvalue of sparse random graphs M Krivelevich, B Sudakov Combinatorics, Probability and Computing 12 (1), 61-72, 2003 | 226 | 2003 |
Recent developments in graph Ramsey theory. D Conlon, J Fox, B Sudakov Surveys in combinatorics 424 (2015), 49-118, 2015 | 199 | 2015 |
Local resilience of graphs B Sudakov, VH Vu Random Structures & Algorithms 33 (4), 409-433, 2008 | 167 | 2008 |
Turán numbers of bipartite graphs and related Ramsey-type questions N Alon, M Krivelevich, B Sudakov Combinatorics, Probability and Computing 12 (5-6), 477-494, 2003 | 153 | 2003 |
Coloring graphs with sparse neighborhoods N Alon, M Krivelevich, B Sudakov Journal of Combinatorial Theory, Series B 77 (1), 73-82, 1999 | 146 | 1999 |
Dependent random choice J Fox, B Sudakov Random Structures & Algorithms 38 (1‐2), 68-99, 2011 | 138 | 2011 |
Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 136 | 2005 |
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels N Alon, P Frankl, H Huang, V Rödl, A Ruciński, B Sudakov Journal of Combinatorial Theory, Series A 119 (6), 1200-1215, 2012 | 133 | 2012 |
The phase transition in random graphs: A simple proof M Krivelevich, B Sudakov Random Structures & Algorithms 43 (2), 131-138, 2013 | 132 | 2013 |
Random regular graphs of high degree M Krivelevich, B Sudakov, VH Vu, NC Wormald Random Structures & Algorithms 18 (4), 346-363, 2001 | 131 | 2001 |
The Turán number of the Fano plane P Keevash, B Sudakov Combinatorica 25 (5), 561-574, 2005 | 128* | 2005 |
Sparse pseudo‐random graphs are Hamiltonian M Krivelevich, B Sudakov Journal of Graph Theory 42 (1), 17-33, 2003 | 127 | 2003 |
An approximate version of Sidorenko’s conjecture D Conlon, J Fox, B Sudakov Geometric and Functional Analysis 20, 1354-1366, 2010 | 126 | 2010 |
The size of a hypergraph and its matching number H Huang, PS Loh, B Sudakov Combinatorics, Probability and Computing 21 (3), 442-450, 2012 | 124 | 2012 |
Hypergraph ramsey numbers D Conlon, J Fox, B Sudakov Journal of the American Mathematical Society 23 (1), 247-266, 2010 | 124 | 2010 |
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality E Mossel, R O'Donnell, O Regev, JE Steif, B Sudakov Israel Journal of Mathematics 154 (1), 299-336, 2006 | 116 | 2006 |
Learning a hidden matching N Alon, R Beigel, S Kasif, S Rudich, B Sudakov SIAM Journal on Computing 33 (2), 487-501, 2004 | 112 | 2004 |