Miloš Trujić

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Blow-up lemma for cycles in sparse random graphs Combinatorica	2025-12-08	Paper
On the size-Ramsey number of grids Combinatorics, Probability and Computing	2024-11-05	Paper
Transference for loose Hamilton cycles in random 3-uniform hypergraphs Random Structures & Algorithms	2024-09-02	Paper
Ramsey numbers for multiple copies of sparse graphs Journal of Graph Theory	2024-07-02	Paper
Covering cycles in sparse graphs Random Structures & Algorithms	2023-10-12	Paper
The size‐Ramsey number of cubic graphs Bulletin of the London Mathematical Society	2023-09-20	Paper
Ramsey numbers for multiple copies of sparse graphs	2022-12-05	Paper
Transference for loose Hamilton cycles in random 3-uniform hypergraphs	2022-05-23	Paper
On the size-Ramsey number of grids	2022-02-03	Paper
Triangle resilience of the square of a Hamilton cycle in random graphs Journal of Combinatorial Theory. Series B	2021-11-17	Paper
Blow-up lemma for cycles in sparse random graphs	2021-11-17	Paper
Sprinkling a few random edges doubles the power SIAM Journal on Discrete Mathematics	2021-05-28	Paper
The Chromatic Number of Dense Random Block Graphs	2020-07-15	Paper
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm (available as arXiv preprint)	2020-02-12	Paper
The Chromatic Number of Dense Random Block Graphs (available as arXiv preprint)	2020-01-01	Paper
The edge-statistics conjecture for $\ell \ll k^{6/5} $ Israel Journal of Mathematics	2019-12-17	Paper
Resilience of perfect matchings and Hamiltonicity in random graph processes Random Structures & Algorithms	2019-08-14	Paper
On resilience of connectivity in the evolution of random graphs The Electronic Journal of Combinatorics	2019-05-20	Paper
On resilience of connectivity in the evolution of random graphs The Electronic Journal of Combinatorics	2019-05-20	Paper
Local resilience of an almost spanning <i>k</i>‐cycle in random graphs Random Structures & Algorithms	2019-02-20	Paper

Research outcomes over time

This page was built for person: Miloš Trujić