Monochromatic paths in random tournaments. - Matija Bucic; Shoham Letzter; Benny Sudakov (Electron. Notes Discret. Math., 2017)

Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems. - Matija Bucic; Melkior Ornik; Ufuk Topcu (Allerton, 2018)

An improved bound for disjoint directed cycles. - Matija Bucic (Discret. Math., 2018)

Multicolour Bipartite Ramsey Number of Paths. - Matija Bucic; Shoham Letzter; Benny Sudakov (Electron. J. Comb., 2019)

Partition problems in high dimensional boxes. - Matija Bucic; Bernard Lidický; Jason Long; Adam Zsolt Wagner (J. Comb. Theory A, 2019)

Directed Ramsey number for trees. - Matija Bucic; Shoham Letzter; Benny Sudakov (J. Comb. Theory B, 2019)

3-Color bipartite Ramsey number of cycles and paths. - Matija Bucic; Shoham Letzter; Benny Sudakov (J. Graph Theory, 2019)

Monochromatic trees in random tournaments. - Matija Bucic; Sven Heberle; Shoham Letzter; Benny Sudakov (Comb. Probab. Comput., 2020)

2-factors with k cycles in Hamiltonian graphs. - Matija Bucic; Erik Jahn; Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2020)

Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. - Matija Bucic; Dániel Korándi; Benny Sudakov (Comb., 2021)

Tournament Quasirandomness from Local Counting. - Matija Bucic; Eoin Long; Asaf Shapira; Benny Sudakov (Comb., 2021)

Universal and unavoidable graphs. - Matija Bucic; Nemanja Draganic; Benny Sudakov (Comb. Probab. Comput., 2021)

Unavoidable hypergraphs. - Matija Bucic; Nemanja Draganic; Benny Sudakov; Tuan Tran (J. Comb. Theory B, 2021)

List Ramsey numbers. - Noga Alon; Matija Bucic; Tom Kalvari; Eden Kuperwasser; Tibor Szabó (J. Graph Theory, 2021)

Perfect matchings and derangements on graphs. - Matija Bucic; Pat Devlin 001; Mo Hendon; Dru Horne; Ben Lund 002 (J. Graph Theory, 2021)

Clique minors in graphs with a forbidden subgraph. - Matija Bucic; Jacob Fox; Benny Sudakov (Random Struct. Algorithms, 2022)

Towards the Erdős-Gallai Cycle Decomposition Conjecture. - Matija Bucic; Richard Montgomery 001 (STOC, 2023)

The ( t - 1 ) $(t-1)$ -chromatic Ramsey number for paths. - Matija Bucic; Amir Khamseh (J. Graph Theory, 2023)

Covering random graphs with monochromatic trees. - Domagoj Bradac; Matija Bucic (Random Struct. Algorithms, 2023)

Large Independent Sets from Local Considerations. - Matija Bucic; Benny Sudakov (Comb., 2023)