Seuraa
Nemanja Draganić
Nemanja Draganić
University of Oxford
Vahvistettu sähköpostiosoite verkkotunnuksessa maths.ox.ac.uk - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
282022
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
162021
Large induced matchings in random graphs
O Cooley, N Draganic, M Kang, B Sudakov
SIAM Journal on Discrete Mathematics 35 (1), 267-280, 2021
142021
The size‐Ramsey number of short subdivisions
N Draganić, M Krivelevich, R Nenadov
Random Structures & Algorithms 59 (1), 68-78, 2021
102021
Hamiltonicity of expanders: optimal bounds and applications
N Draganić, R Montgomery, DM Correia, A Pokrovskiy, B Sudakov
arXiv preprint arXiv:2402.06603, 2024
92024
Pancyclicity of Hamiltonian graphs
N Draganić, DM Correia, B Sudakov
Journal of the European Mathematical Society, 2024
82024
Size-Ramsey numbers of structurally sparse graphs
N Draganić, M Kaufmann, DM Correia, K Petrova, R Steiner
arXiv preprint arXiv:2307.12028, 2023
72023
Size-Ramsey numbers of graphs with maximum degree three
N Draganić, K Petrova
arXiv preprint arXiv:2207.05048, 2022
72022
Tight bounds for divisible subdivisions
S Das, N Draganić, R Steiner
Journal of Combinatorial Theory, Series B 165, 1-19, 2024
62024
Chvátal-Erdős condition for pancyclicity
N Draganić, DM Correia, B Sudakov
European Conference on Combinatorics, Graph Theory and Applications, 373-379, 2023
62023
The largest hole in sparse random graphs
N Draganić, S Glock, M Krivelevich
Random Structures & Algorithms 61 (4), 666-677, 2022
62022
Large induced trees in dense random graphs
N Draganić
arXiv preprint arXiv:2004.02800, 2020
62020
A Ramsey theorem for multiposets
N Draganić, D Mašulović
European Journal of Combinatorics 81, 142-149, 2019
62019
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
52022
Short proofs for long induced paths
N Draganić, S Glock, M Krivelevich
Combinatorics, Probability and Computing 31 (5), 870-878, 2022
52022
A generalization of Bondy’s pancyclicity theorem
N Draganić, DM Correia, B Sudakov
Combinatorics, Probability and Computing 33 (5), 554-563, 2024
42024
Cycles with many chords
N Draganić, A Methuku, D Munhá Correia, B Sudakov
Random Structures & Algorithms 65 (1), 3-16, 2024
42024
Universal and unavoidable graphs
M Bucić, N Draganić, B Sudakov
Combinatorics, Probability and Computing 30 (6), 942-955, 2021
42021
Effective bounds for induced size-Ramsey numbers of cycles
D Bradač, N Draganić, B Sudakov
Combinatorica 44 (5), 1011-1039, 2024
32024
Tight bounds for powers of Hamilton cycles in tournaments
N Draganić, DM Correia, B Sudakov
Journal of Combinatorial Theory, Series B 158, 305-340, 2023
22023
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20