Matija Bucic

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 22

Top Topics

High Dimensional

Subgraph Mining

Top Venues

J. Graph Theory

Random Struct. Algorithms

J. Comb. Theory, Ser. B

Publications

Domagoj Bradac, Matija Bucic
Covering random graphs with monochromatic trees. Random Struct. Algorithms 62 (3) (2023)
Matija Bucic, Amir Khamseh
The ( t - 1 ) $(t-1)$ -chromatic Ramsey number for paths. J. Graph Theory 102 (4) (2023)
Matija Bucic, Benny Sudakov
Large Independent Sets from Local Considerations. Comb. 43 (3) (2023)
Matija Bucic, Richard Montgomery
Towards the Erdős-Gallai Cycle Decomposition Conjecture. STOC (2023)
Matija Bucic, Jacob Fox, Benny Sudakov
Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60 (3) (2022)
Matija Bucic, Nemanja Draganic, Benny Sudakov
Universal and unavoidable graphs. Comb. Probab. Comput. 30 (6) (2021)
Matija Bucic, Dániel Korándi, Benny Sudakov
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. 41 (3) (2021)
Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran
Unavoidable hypergraphs. J. Comb. Theory, Ser. B 151 (2021)
Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov
Tournament Quasirandomness from Local Counting. Comb. 41 (2) (2021)
Noga Alon, Matija Bucic, Tom Kalvari, Eden Kuperwasser, Tibor Szabó
List Ramsey numbers. J. Graph Theory 96 (1) (2021)
Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, Ben Lund
Perfect matchings and derangements on graphs. J. Graph Theory 97 (2) (2021)
Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov
Monochromatic trees in random tournaments. Comb. Probab. Comput. 29 (3) (2020)
Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov
cycles in Hamiltonian graphs. J. Comb. Theory, Ser. B 144 (2020)
Matija Bucic, Bernard Lidický, Jason Long, Adam Zsolt Wagner
Partition problems in high dimensional boxes. J. Comb. Theory, Ser. A 166 (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory 92 (4) (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
Monochromatic paths in random tournaments. Random Struct. Algorithms 54 (1) (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
Directed Ramsey number for trees. J. Comb. Theory, Ser. B 137 (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
Multicolour Bipartite Ramsey Number of Paths. Electron. J. Comb. 26 (3) (2019)
Matija Bucic, Melkior Ornik, Ufuk Topcu
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems. Allerton (2018)
Matija Bucic
An improved bound for disjoint directed cycles. Discret. Math. 341 (8) (2018)
Matija Bucic, Shoham Letzter, Benny Sudakov
Monochromatic paths in random tournaments. Electron. Notes Discret. Math. 61 (2017)
Matija Bucic, Shoham Letzter, Benny Sudakov
Directed Ramsey number for trees. Electron. Notes Discret. Math. 61 (2017)