| 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 | 22 | 2022 |
| Powers of paths in tournaments N Draganić, F Dross, J Fox, A Girão, F Havet, D Korándi, W Lochet, ... Combinatorics, Probability and Computing 30 (6), 894-898, 2021 | 10 | 2021 |
| Large induced matchings in random graphs O Cooley, N Draganic, M Kang, B Sudakov SIAM Journal on Discrete Mathematics 35 (1), 267-280, 2021 | 10 | 2021 |
| The size‐Ramsey number of short subdivisions N Draganić, M Krivelevich, R Nenadov Random Structures & Algorithms 59 (1), 68-78, 2021 | 9 | 2021 |
| Size-Ramsey numbers of graphs with maximum degree three N Draganić, K Petrova arXiv preprint arXiv:2207.05048, 2022 | 6 | 2022 |
| Chvátal-Erdős condition for pancyclicity N Draganić, DM Correia, B Sudakov European Conference on Combinatorics, Graph Theory and Applications, 373-379, 2023 | 5 | 2023 |
| Pancyclicity of Hamiltonian graphs N Draganić, DM Correia, B Sudakov arXiv preprint arXiv:2209.03325, 2022 | 5 | 2022 |
| The largest hole in sparse random graphs N Draganić, S Glock, M Krivelevich Random Structures & Algorithms 61 (4), 666-677, 2022 | 4 | 2022 |
| Ramsey number of 1-subdivisions of transitive tournaments N Draganić, DM Correia, B Sudakov, R Yuster Journal of Combinatorial Theory, Series B 157, 176-183, 2022 | 4 | 2022 |
| Large induced trees in dense random graphs N Draganić arXiv preprint arXiv:2004.02800, 2020 | 4 | 2020 |
| A Ramsey theorem for multiposets N Draganić, D Mašulović European Journal of Combinatorics 81, 142-149, 2019 | 4 | 2019 |
| Cycles with many chords N Draganić, A Methuku, D Munhá Correia, B Sudakov Random Structures & Algorithms, 2024 | 3 | 2024 |
| Short proofs for long induced paths N Draganić, S Glock, M Krivelevich Combinatorics, Probability and Computing 31 (5), 870-878, 2022 | 3 | 2022 |
| Universal and unavoidable graphs M Bucić, N Draganić, B Sudakov Combinatorics, Probability and Computing 30 (6), 942-955, 2021 | 3 | 2021 |
| Tight bounds for divisible subdivisions S Das, N Draganić, R Steiner Journal of Combinatorial Theory, Series B 165, 1-19, 2024 | 2 | 2024 |
| A generalization of Bondy's pancyclicity theorem N Draganić, DM Correia, B Sudakov arXiv preprint arXiv:2302.12752, 2023 | 2 | 2023 |
| A characterization of idempotent strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties N Draganić, P Marković, V Uljarević, S Zahirović Algebra universalis 79 (3), 53, 2018 | 2 | 2018 |
| Optimal Hamilton covers and linear arboricity for random graphs N Draganić, S Glock, DM Correia, B Sudakov arXiv preprint arXiv:2310.11580, 2023 | 1 | 2023 |
| Size-Ramsey numbers of structurally sparse graphs N Draganić, M Kaufmann, DM Correia, K Petrova, R Steiner arXiv preprint arXiv:2307.12028, 2023 | 1 | 2023 |
| Effective bounds for induced size-Ramsey numbers of cycles D Bradač, N Draganić, B Sudakov arXiv preprint arXiv:2301.10160, 2023 | 1 | 2023 |
Benjamin SudakovETH, ZurichПодтвержден адрес электронной почты в домене math.ethz.ch
