I started my third year as a 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.

Phone: +41 44 632 8509.

Email: nemanja.draganic@math.ethz.ch

Office address: Department of Mathematics, ETH, HG J 65

Rämistrasse 101, 8092 Zürich, Switzerland

Random Graphs

Ramsey Theory

Extremal Combinatorics

Algebraic and Probabilistic Methods in Combinatorics

Theoretical Computer Science

Fall 2021 - teaching assistant and course organizer for Algebraic Methods in Combinatorics, ETH Zurich.

Spring 2021 - teaching assistant for Graph Theory, ETH Zurich.

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.

- Das, S., Draganić, N., Steiner, R. (2021). Tight bounds for divisible subdivisions, submitted.

- Draganić, N., Munhá Correia, D., Sudakov, B., Yuster, R. (2021). Ramsey number of 1-subdivisions of transitive tournaments, submitted.

- Draganić, N., Glock, S., Krivelevich, M. (2021). Short proofs for long induced paths, accepted to Combinatorics, Probability and Computing.

- Draganić, N., Glock, S., Krivelevich, M. (2021). The largest hole in sparse random graphs, accepted to Random Structures and Algorithms.

- Draganić, N., Munhá Correia, D., Sudakov, B. (2021). Tight bounds for powers of Hamilton cycles in tournaments, submitted.

- Bucić, M., Draganić, N., Sudakov, B. and Tuan, T. (2021). Unavoidable hypergraphs, Journal of Combinatorial Theory, Ser. B 151: 307-338

- 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, Combinatorics, Probability and Computing 30: 894-898.

- Draganić, N., Krivelevich, M. and Nenadov R. (2021). Rolling backwards can move you forward: on embedding
problems in sparse expanders, accepted to Transactions of AMS. A preliminary version appeared in Proceedings of the 32nd Symposium on Discrete Algorithms (SODA'21), 123-134.

- Draganić, N., Krivelevich, M. and Nenadov R. (2020). The size-Ramsey number of short subdivisions, Random Structures and Algorithms 59: 68– 78.

- Cooley, O., Draganić, N., Kang, M. and Sudakov, B. (2021). Large induced matchings in random graphs, SIAM Journal on Discrete Mathematics 35(1): 267-280.

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

- Bucić, M., Draganić, N. and Sudakov, B. (2021). Universal and unavoidable graphs, Combinatorics, Probability and Computing 30: 942-955.

- 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.