Milos Trujic

12 papers A 1Journal 11
YearRankTypeTitle / Venue / Authors
2025 J jnl
Blow-up Lemma for Cycles in Sparse Random Graphs.
Comb.
Milos Trujic
2024 J jnl
Ramsey numbers for multiple copies of sparse graphs.
J. Graph Theory
Aurelio L. Sulser, Milos Trujic
2024 J jnl
Transference for loose Hamilton cycles in random 3-uniform hypergraphs.
Random Struct. Algorithms
Kalina Petrova, Milos Trujic
2023 J jnl
On the size-Ramsey number of grids.
Comb. Probab. Comput.
David Conlon, Rajko Nenadov, Milos Trujic
2022 J jnl
Covering cycles in sparse graphs.
Random Struct. Algorithms
Frank Mousset, Nemanja Skoric, Milos Trujic
2022 J jnl
Triangle resilience of the square of a Hamilton cycle in random graphs.
J. Comb. Theory B
Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic
2021 J jnl
Sprinkling a Few Random Edges Doubles the Power.
SIAM J. Discret. Math.
Rajko Nenadov, Milos Trujic
2020 J jnl
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm.
CoRR
Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
2020 A conf
An Optimal Decentralized (Δ + 1)-Coloring Algorithm.
ESA
Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
2019 J jnl
On Resilience of Connectivity in the Evolution of Random Graphs.
Electron. J. Comb.
Luc Haller, Milos Trujic
2019 J jnl
Resilience of perfect matchings and Hamiltonicity in random graph processes.
Random Struct. Algorithms
Rajko Nenadov, Angelika Steger, Milos Trujic
2018 J jnl
Local resilience of an almost spanning k-cycle in random graphs.
Random Struct. Algorithms
Nemanja Skoric, Angelika Steger, Milos Trujic