| A short proof of the random Ramsey theorem R Nenadov, A Steger Combinatorics, Probability and Computing 25 (1), 130-144, 2016 | 63 | 2016 |
| Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs R Nenadov, N Škorić Random Structures & Algorithms 54 (1), 187-208, 2019 | 38 | 2019 |
| 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 |
| Robust Hamiltonicity of random directed graphs A Ferber, R Nenadov, A Noever, U Peter, N Škorić Journal of Combinatorial Theory, Series B 126, 1-23, 2017 | 30 | 2017 |
| An algorithmic framework for obtaining lower bounds for random Ramsey problems R Nenadov, Y Person, N Škorić, A Steger Journal of Combinatorial Theory, Series B 124, 1-38, 2017 | 29 | 2017 |
| On the threshold for the Maker‐Breaker H‐game R Nenadov, A Steger, M Stojaković Random Structures & Algorithms 49 (3), 558-578, 2016 | 28 | 2016 |
| Universality of random graphs and rainbow embedding A Ferber, R Nenadov, U Peter Random Structures & Algorithms 48 (3), 546-564, 2016 | 28 | 2016 |
| On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem R Nenadov, Y Pehova SIAM Journal on Discrete Mathematics 34 (2), 1001-1010, 2020 | 26 | 2020 |
| Symmetric and asymmetric Ramsey properties in random hypergraphs L Gugelmann, R Nenadov, Y Person, N Škorić, A Steger, H Thomas Forum of Mathematics, Sigma 5, e28, 2017 | 26 | 2017 |
| Rolling backwards can move you forward: on embedding problems in sparse expanders N Draganić, M Krivelevich, R Nenadov Transactions of the American Mathematical Society 375 (7), 5195-5216, 2022 | 25 | 2022 |
| Resilience of perfect matchings and Hamiltonicity in random graph processes R Nenadov, A Steger, M Trujić Random Structures & Algorithms 54 (4), 797-819, 2019 | 25 | 2019 |
| Optimal induced universal graphs for bounded-degree graphs N Alon, R Nenadov Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 22 | 2017 |
| Sprinkling a few random edges doubles the power R Nenadov, M Trujić SIAM Journal on Discrete Mathematics 35 (2), 988-1004, 2021 | 21 | 2021 |
| Almost‐spanning universality in random graphs D Conlon, A Ferber, R Nenadov, N Škorić Random Structures & Algorithms 50 (3), 380-393, 2017 | 19 | 2017 |
| Spanning universality in random graphs A Ferber, R Nenadov Random Structures & Algorithms 53 (4), 604-637, 2018 | 17 | 2018 |
| Monochromatic cycle covers in random graphs D Korándi, F Mousset, R Nenadov, N Škorić, B Sudakov Random Structures & Algorithms 53 (4), 667-691, 2018 | 15 | 2018 |
| On the number of graphs without large cliques F Mousset, R Nenadov, A Steger SIAM Journal on Discrete Mathematics 28 (4), 1980-1986, 2014 | 15 | 2014 |
| Completion and deficiency problems R Nenadov, B Sudakov, AZ Wagner Journal of Combinatorial Theory, Series B 145, 214-240, 2020 | 14 | 2020 |
| Proof of the Brown–Erdős–Sós conjecture in groups R Nenadov, B Sudakov, M Tyomkyn Mathematical Proceedings of the Cambridge Philosophical Society 169 (2), 323-333, 2020 | 14 | 2020 |
| Unique reconstruction threshold for random jigsaw puzzles R Nenadov, P Pfister, A Steger arXiv preprint arXiv:1605.03043, 2016 | 14 | 2016 |
Nemanja SkoricGoogle ZurichVerified email at google.com
