Contact Info
I am currently a second year PhD student in the Department of Mathematics at ETH Zürich under the guidance of Benny Sudakov. Previously, I received a masters degree from ETH Zürich and a bachelors degree from the University of Novi Sad. |

Algebraic and Probabilistic Methods in Combinatorics, Theoretical Computer Science

- Spring 2020 - teaching assistant for Graph Theory, ETH Zurich.
- Spring 2019 - teaching assistant for Analysis II, ETH Zurich.
- Fall 2018 - teaching assistant for Analysis I, ETH Zurich.
- Fall 2017 - teaching assistant for Analysis I, ETH Zurich.

- Bucić, M., Draganić, N., Sudakov, B. and Tuan, T. (2020). Unavoidable hypergraphs, submitted.

- Draganić, N., Dross, F., Fox, J., Girão, A., Havet, F., Korándi, D., Lochet, W., Munhá Correia, D., Scott, A. and Sudakov, B. (2020). Powers of paths in tournaments, submitted.

- Draganić, N., Krivelevich, M. and Nenadov R. (2020). Rolling backwards can move you forward: on embedding
problems in sparse expanders, accepted to SODA'21.

- Draganić, N., Krivelevich, M. and Nenadov R. (2020). The size-Ramsey number of short subdivisions, accepted to Random Structures and Algorithms.

- Cooley, O., Draganić, N., Kang, M. and Sudakov, B. (2020). Large induced matchings in random graphs, accepted to SIDMA.

- Draganić, N. (2020). Large induced trees in dense random graphs.

- Bucić, M., Draganić, N. and Sudakov, B. (2019). Universal and unavoidable graphs, submitted.

- Draganić, N. and Mašulović, D. (2018). A Ramsey Theorem for Multiposets, European Journal of Combinatorics 81: 142-149.

- Draganić, N., Marković, P., Uljarević, V. and Zahirović, S. (2017). A characterization of idempotent strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties , Algebra universalis 79(3), article no. 53.