ETH Zürich
Miloš Trujić
Institut für Theoretische Informatik
CAB G 33.3
Universitätstrasse 6
8092 Zürich
Phone: +41 44 632 73 39
E-Mail: mtrujic@inf.ethz.ch
I am a postdoctoral researcher in Computer Science at ETH Zürich in the group of Professor Angelika Steger. Prior to this I received my PhD at ETH Zürich in 2021, my adviser was Professor Angelika Steger, my Master's degree from ETH Zürich in 2016, and my Bachelor's degree from University of Novi Sad in 2014. My research interests include, but are not limited to, probabilistic and extremal combinatorics, graph theory, random graph theory, and random discrete structures.
Ramsey
numbers for multiple copies of sparse graphs
(joint with A. Sulser)
submitted December 2022
Transference
for loose Hamilton cycles in random 3-uniform hypergraphs
(joint with K. Petrova)
submitted May 2022
On the
size-Ramsey number of grids
(joint with D. Conlon and R. Nenadov)
submitted February 2022
Blow-up lemma
for cycles in sparse random graphs
submitted November 2021
The chromatic
number of dense random block graphs
(joint with A. Martinsson, K. Panagiotou, and P. Su)
submitted July 2020
The
size-Ramsey number of cubic graphs
(joint with D. Conlon and R. Nenadov)
Bulletin of the London Mathematical Society 54,
2135-2150
Covering
cycles in sparse graphs
(joint with F. Mousset and N. Škorić)
Random Structures & Algorithms 60, 716-748
Triangle
resilience of the square of a Hamilton cycle in random graphs
(joint with M. Fischer, N. Škorić, and A. Steger)
Journal of Combinatorial Theory, Series B 152, 171-220
Sprinkling a
few random edges doubles the power
(joint with R. Nenadov)
SIAM Journal on Discrete Mathematics 35, 988-1004
An optimal
decentralized (Δ+1)-coloring algorithm
(joint with D. Bertschinger, J. Lengler, A. Martinsson, R. Meier, A.
Steger, and E. Welzl)
28th Annual European Symposium on Algorithms (ESA 2020)
The
edge-statistics conjecture for ℓ ≪ k6/5
(joint with A. Martinsson, F. Mousset, and A. Noever)
Israel Journal of Mathematics 234, 677-690
Resilience of
perfect matchings and Hamiltonicity in random graph processes
(joint with R. Nenadov and A. Steger)
Random Structures & Algorithms 54, 797-819
On
resilience of connectivity in the evolution of random graphs
(joint with L. Haller)
Electronic Journal of Combinatorics 26, P2.24
Local
resilience of an almost spanning k-cycle in random graphs
(joint with N. Škorić and A. Steger)
Random Structures & Algorithms 53, 728-751
July 2019 | RS&A 2019, ETH Zurich, Zurich |
May 2019 | CoG 2019, Moscow Institute of Physics and Technology, Moscow |
March 2018 | SLADIM+, University of Novi Sad, Novi Sad |
July 2017 | NSFOCS 2017, University of Novi Sad, Novi Sad |
August 2017 | RS&A 2017, Institute of European Culture, Gniezno |