Below, you’ll find a list of my publications.
Below, you’ll find a list of my publications.
Embedded Files
I have moved, this website is no longer being updated! Click here to go to the new website.
Working Drafts
Working Drafts
M. Bucić, M. Christoph, A. Pokrovskiy, R. Steiner:
Lovasz conjecture holds asymptotically, in preparation (first posted online Sep. 23).
Papers
Papers
2026+
2026+
B. Bedert, M. Bucic, N. Kravitz, R. Montgomery, A. Müyesser:
On Graham's rearrangement conjecture over F_2^n, submitted.
I. Balla, M. Bucic:
Equiangular lines in the exponential regime, submitted.
M. Bucić, K. Henrey, B. Mohar, R. Steiner, L. Yepremyan:
Long cycles in vertex transitive digraphs, submitted.
M. Bucić, M. Christoph, A. Pokrovskiy, R. Steiner:
Towards the Lovasz conjecture via sublinear expanders, submitted.
M. Bucić, K. Chen, J. Ma:
On a maximal anti-Ramsey conjecture of Burr, Erdős, Graham, and Sós, submitted.
M. Bucić, M. Christoph, A. Müyesser, R. Steiner:
Topological Minors in Typical Lifts, submitted.
M. Bucić, J. Fox, H. T. Pham:
Equivalence between Erdős-Hajnal and polynomial Rödl and Nikiforov conjectures, submitted.
D. Plecko, D. Bradac, M. Bucic, E. Bareinboim
Beyond the back-door: Probabilities of Identification, submitted.
M. Bucić, B. Frederickson, A. Müyesser, A. Pokrovskiy, L. Yepremyan:
Towards Graham's rearrangement conjecture via rainbow paths, accepted in Advances in Mathematics.
M. Bucić, M. Christoph, J. Kim, H. Lee, V. Sivashankar:
On a Ramsey-Turán variant of Roth’s theorem, accepted in Bulletin of the LMS.
M. Bucić, V. Jain, V. Sivashankar:
Intersecting hypergraphs with large cover number, accepted in Combinatorial Theory.
N. Alon, M. Bucić, L. Gishboliner:
The spanning tree spectrum: improved bounds and simple proofs, accepted in Proceedings of the AMS.
2026
2026
M. Bucić, Z. He, S.-E. Huang, T. Saranurak
Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching, SODA 2026.
2025
2025
N. Alon, M. Bucic, L. Sauermann, Dmitrii Zakharov, Or Zamir:
Essentially tight bounds for rainbow cycles in proper edge-colourings, Proceedings of the LMS 130(4), e70044 (2025).
N. Alon, M. Bucic, L. Sauermann:
Unit and distinct distances in typical norms, GAFA, (2025).
M. Bucić, J. Davies:
Geometric graphs with exponential chromatic number and arbitrary girth, American Mathematical Monthly 132(9), 883–894, (2025).
M. Bucić, M. Chudnovsky, J. Codsi:
Counting independent sets in structured graphs, Combinatorics, Probability and Computing (2025), 34, pp. 625–634.
2024
2024
N. Alon, M. Bucić, M. Christoph, M. Krivelevich:
Power of many colours, Forum of Mathematics, Sigma, 12, e118, (2024).
M. Bucic, R. Montgomery:
Towards the Erdős-Gallai Cycle Decomposition Conjecture, Advances in Mathematics, 437, (2024).
Abbreviated version appeared in STOC 2023 (proceedings version).
M. Bucic, T. Nguyen, A. Scott, P. Seymour:
Induced subgraph density. I. A loglog step towards Erdos-Hajnal, IMRN, 12, (2024).
R. Bourneuf, M. Bucić, L. Cook, J. Davies:
On polynomial degree-boundedness, Advances in Combinatorics 5, 16pp, (2024).
P. Blanco, M. Bucic:
Towards the Erdős-Hajnal conjecture for P_5-free graphs, Research in the Mathematical Sciences, 11(2), (2024).
2023
2023
M. Bucic, B. Sudakov, T. Tran:
Erdős-Szekeres theorem for multidimensional arrays, JEMS, 25(8), (2023), 2927–2947.
M. Bucic, J. Cooper, D. Kral, S. Mohr, D. Munha-Correia:
Uniform Turan density of cycles, Transactions of the AMS 376(7), (2023), 4765-4809.
D. Bradac, M. Bucic, B. Sudakov:
Turan numbers of sunflowers, Proceedings of AMS 151 (2023), 961-975.
M. Bucic, O. Janzer, B. Sudakov:
Counting H-free orientations of graphs, Mathematical Proceedings of the Cambridge Philosophical Society 174(1), (2023), 79-95.
M. Bucic, B. Sudakov:
Large independent sets from local considerations, Combinatorica 43, (2023), 505-546.
M. Bucic, B. Sudakov:
Tight Ramsey bounds for multiple copies of a graph, Advances in Combinatorics, no. 1, (2023), 1-22.
D. Bradac, M. Bucic:
Covering random graphs with monochromatic trees, Random Structures and Algorithms 62.3 (2023), 545-563.
M. Bucic, A. Khamseh:
The (t-1)-chromatic Ramsey number for paths, Journal of Graph Theory, 102(4), (2023), 784-796.
2022
2022
M. Bucic, S. Glock, B. Sudakov:
The intersection spectrum of 3-chromatic intersecting hypergraphs, Proceedings of LMS 124.5, (2022), 680-690.
M. Bucic, L. Gishboliner, B. Sudakov:
Cycles of many lengths in Hamiltonian graphs, Forum of Mathematics, Sigma 10, E70, (2022).
M. Bucic, J. Fox, B. Sudakov:
Clique minors in graphs with forbidden subgraphs and other restrictions, Random Structures and Algorithms 60.3, (2022), 327-338.
2021
2021
N. Alon, M. Bucic, B. Sudakov:
Large cliques and independent sets all over the place, Proceedings of AMS 149 (2021), 3145-3157.
M. Bucic, N. Draganic, B. Sudakov and T. Tran:
Unavoidable hypergraphs, Journal of Combinatorial Theory, Series B 151 (2021), 307-338.
M. Bucic, D. Korándi, B. Sudakov:
Covering random graphs by monochromatic trees and Helly-type results for hypergraphs, Combinatorica 41 (2021), 319-352.
M. Bucic, E. Long, A. Shapira, B. Sudakov:
Tournament quasirandomness from local counting, Combinatorica 41 (2021), 175-208.
M. Bucic, N. Draganic, B. Sudakov:
Universal and unavoidable graphs, Combinatorics, Probability and Computing 30.6, (2021), 942-955.
N. Alon, M. Bucic, T. Kalvari, E. Kuperwasser, T. Szabó:
List Ramsey numbers, Journal of Graph Theory 96.1 (2021), 109-128.
M. Bucic, P. Devlin, M. Hendon, D. Horne, B. Lund:
Perfect matchings and derangements on graphs, Journal of Graph Theory 97.2 (2021), 340-354.
2020
2020
M. Bucic, M. Kwan, A. Pokrovskiy, B. Sudakov:
Halfway to Rota's basis conjecture, Int. Math. Res. Not. (IMRN) 21 (2020), 8007-8026.
M. Bucic, M. Kwan, A. Pokrovskiy, B. Sudakov:
On Kahn's basis conjecture, unpublished companion note, arXiv:1810.07464.
M. Bucic, M. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A. Z. Wagner:
Nearly-linear monotone paths in edge-ordered graphs, Israel Journal of Mathematics 238, (2020), 663-685.
M. Bucic, E. Jahn, A. Pokrovskiy, B. Sudakov:
2-factors with k cycles in Hamiltonian graphs, Journal of Combinatorial Theory, Series B. 144 (2020), 150-166.
M. Bucic, S. Heberle, S. Letzter, B. Sudakov:
Monochromatic trees in random tournaments, Combinatorics, Probability and Computing 29.3 (2020), 318-345.
2019
2019
M. Bucic, S. Letzter, B. Sudakov:
Multicolour bipartite Ramsey number of paths, The Electronic Journal of Combinatorics 26 (2019), P3.60.
M. Bucic, M. Ornik, U. Topcu:
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems, 56th Allerton Conference on Communication, Control, and Computing.
M. Bucic, B. Lidicky, J. Long, A. Z. Wagner:
Partition problems in high dimensional boxes, Journal of Combinatorial Theory, Series A 166 (2019), 315-336.
M. Bucic, S. Letzter, B. Sudakov:
Three colour bipartite Ramsey number of cycles and paths, Journal of Graph Theory 92.4 (2019), 445-459.
M. Bucic, S. Letzter, B. Sudakov:
Directed Ramsey number for trees, Journal of Combinatorial Theory, Series B 137 (2019), 145-177.
M. Bucic, S. Letzter, B. Sudakov:
Monochromatic paths in random tournaments, Random Structures and Algorithms 54.1 (2019), 69-81.
2018
2018
M. Bucic, S. Letzter, B. Sudakov, T. Tran:
Minimum saturated families of sets, Bulletin of the London Mathematical Society 50.4 (2018), 725-732.
M. Bucic:
An Improved Bound for Disjoint Directed Cycles, Discrete Mathematics 341.8 (2018), 2231-2236.
Below, you will find a list of some areas/topics with an assignment of my papers related to or using the ideas from said area/topic.
Below, you will find a list of some areas/topics with an assignment of my papers related to or using the ideas from said area/topic.
Ramsey Theory
Ramsey Theory
The intersection spectrum of 3-chromatic intersecting hypergraphs,
Clique minors in graphs with forbidden subgraphs and other restrictions,
Covering random graphs by monochromatic trees and Helly-type results for hypergraphs,
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems,
Probabilistic Methods and Random Structures
Probabilistic Methods and Random Structures
Essentially tight bounds for rainbow cycles in proper edge-colourings
The intersection spectrum of 3-chromatic intersecting hypergraphs
Clique minors in graphs with forbidden subgraphs and other restrictions
Covering random graphs by monochromatic trees and Helly-type results for hypergraphs
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems
Directed Graph Theory
Directed Graph Theory
Discrete Geometry
Discrete Geometry
Additive Number Theory
Additive Number Theory
Constraint Satisfaction Problems
Constraint Satisfaction Problems
Page updated
Report abuse