Resilience of perfect matchings and Hamiltonicity in random graph processes R Nenadov, A Steger, M Trujić
Random Structures & Algorithms 54 (4), 797-819, 2019
25 2019 Sprinkling a few random edges doubles the power R Nenadov, M Trujić
SIAM Journal on Discrete Mathematics 35 (2), 988-1004, 2021
21 2021 Local resilience of an almost spanning k ‐cycle in random graphs N Škorić, A Steger, M Trujić
Random Structures & Algorithms 53 (4), 728-751, 2018
14 2018 Triangle resilience of the square of a Hamilton cycle in random graphs M Fischer, N Škorić, A Steger, M Trujić
Journal of Combinatorial Theory, Series B 152, 171-220, 2022
12 2022 The size‐Ramsey number of cubic graphs D Conlon, R Nenadov, M Trujić
Bulletin of the London Mathematical Society 54 (6), 2135-2150, 2022
10 2022 The edge-statistics conjecture for ℓ ≪ k 6/5 A Martinsson, F Mousset, A Noever, M Trujić
Israel Journal of Mathematics 234 (2), 677-690, 2019
10 2019 On the size-Ramsey number of grids D Conlon, R Nenadov, M Trujić
Combinatorics, Probability and Computing 32 (6), 874-880, 2023
7 2023 Transference for loose Hamilton cycles in random 3‐uniform hypergraphs K Petrova, M Trujić
Random Structures & Algorithms 65 (2), 313-341, 2024
4 2024 An Optimal Decentralized -Coloring Algorithm D Bertschinger, J Lengler, A Martinsson, R Meier, A Steger, M Trujić, ...
arXiv preprint arXiv:2002.05121, 2020
4 2020 The chromatic number of dense random block graphs A Martinsson, K Panagiotou, P Su, M Trujić
arXiv preprint arXiv:2007.07700, 2020
3 2020 Covering cycles in sparse graphs F Mousset, N Škorić, M Trujić
Random Structures & Algorithms 60 (4), 716-748, 2022
1 2022 Blow-up lemma for cycles in sparse random graphs M Trujić
arXiv preprint arXiv:2111.09236, 2021
1 2021 On resilience of connectivity in the evolution of random graphs L Haller, M Trujić
arXiv preprint arXiv:1805.08744, 2018
1 2018 Ramsey numbers for multiple copies of sparse graphs A Sulser, M Trujić
Journal of Graph Theory, 2024
2024 Dirac-type Problems in Random Graphs M Trujić
ETH Zurich, 2021
2021