Matija Bucic

According to our database, Matija Bucic authored at least 23 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2026

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching.

Matija Bucic, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth.

Matija Bucic, James Davies

Am. Math. Mon., October, 2025

Counting independent sets in structured graphs.

Matija Bucic, Maria Chudnovsky, Julien Codsi

Comb. Probab. Comput., 2025

2023

Large Independent Sets from Local Considerations.

Matija Bucic, Benny Sudakov

Comb., June, 2023

Covering random graphs with monochromatic trees.

Domagoj Bradac, Matija Bucic

Random Struct. Algorithms, May, 2023

The ( t - 1 ) $(t-1)$ -chromatic Ramsey number for paths.

Matija Bucic, Amir Khamseh

J. Graph Theory, April, 2023

Towards the Erdős-Gallai Cycle Decomposition Conjecture.

Matija Bucic, Richard Montgomery

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Clique minors in graphs with a forbidden subgraph.

Matija Bucic, Jacob Fox, Benny Sudakov

Random Struct. Algorithms, 2022

2021

Perfect matchings and derangements on graphs.

Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, Ben Lund

J. Graph Theory, 2021

List Ramsey numbers.

Noga Alon, Matija Bucic, Tom Kalvari, Eden Kuperwasser, Tibor Szabó

J. Graph Theory, 2021

Unavoidable hypergraphs.

Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran

J. Comb. Theory B, 2021

Universal and unavoidable graphs.

Matija Bucic, Nemanja Draganic, Benny Sudakov

Comb. Probab. Comput., 2021

Tournament Quasirandomness from Local Counting.

Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov

Comb., 2021

Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs.

Matija Bucic, Dániel Korándi, Benny Sudakov

Comb., 2021

2020

2-factors with <i>k</i> cycles in Hamiltonian graphs.

Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov

J. Comb. Theory B, 2020

Monochromatic trees in random tournaments.

Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov

Comb. Probab. Comput., 2020

2019

3-Color bipartite Ramsey number of cycles and paths.

Matija Bucic, Shoham Letzter, Benny Sudakov

J. Graph Theory, 2019

Partition problems in high dimensional boxes.

Matija Bucic, Bernard Lidický, Jason Long, Adam Zsolt Wagner

J. Comb. Theory A, 2019

Multicolour Bipartite Ramsey Number of Paths.

Matija Bucic, Shoham Letzter, Benny Sudakov

Electron. J. Comb., 2019

2018

An improved bound for disjoint directed cycles.

Matija Bucic

Discret. Math., 2018

Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems.

Matija Bucic, Melkior Ornik, Ufuk Topcu

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

Monochromatic paths in random tournaments.

Matija Bucic, Shoham Letzter, Benny Sudakov

Electron. Notes Discret. Math., 2017

Directed Ramsey number for trees.

Matija Bucic, Shoham Letzter, Benny Sudakov

Electron. Notes Discret. Math., 2017