Stebėti
Matija Bucić
Matija Bucić
Assistant Professor, Princeton University
Patvirtintas el. paštas ias.edu - Pagrindinis puslapis
Pavadinimas
Cituota
Cituota
Metai
3‐Color bipartite Ramsey number of cycles and paths
M Bucić, S Letzter, B Sudakov
Journal of Graph Theory 92 (4), 445-459, 2019
322019
Halfway to Rota’s basis conjecture
M Bucić, M Kwan, A Pokrovskiy, B Sudakov
International Mathematics Research Notices 2020 (21), 8007-8026, 2020
232020
Tournament quasirandomness from local counting
M Bucić, E Long, A Shapira, B Sudakov
Combinatorica 41 (2), 175-208, 2021
202021
Nearly-linear monotone paths in edge-ordered graphs
M Bucić, M Kwan, A Pokrovskiy, B Sudakov, T Tran, AZ Wagner
Israel Journal of Mathematics 238 (2), 663-685, 2020
192020
An improved bound for disjoint directed cycles
M Bucić
Discrete Mathematics 341 (8), 2231-2236, 2018
192018
Multicolour bipartite Ramsey number of paths
M Bucic, S Letzter, B Sudakov
arXiv preprint arXiv:1901.05834, 2019
182019
Induced Subgraph Density. I. A loglog Step Towards Erd̋s–Hajnal
M Bucić, T Nguyen, A Scott, P Seymour
International Mathematics Research Notices 2024 (12), 9991-10004, 2024
152024
Uniform Turán density of cycles
M Bucić, J Cooper, D Kráľ, S Mohr, D Munhá Correia
Transactions of the American Mathematical Society 376 (07), 4765-4809, 2023
14*2023
On polynomial degree-boundedness
R Bourneuf, M Bucić, L Cook, J Davies
arXiv preprint arXiv:2311.03341, 2023
132023
Erdős–Szekeres theorem for multidimensional arrays
M Bucić, B Sudakov, T Tran
Journal of the European Mathematical Society 25 (8), 2927-2947, 2022
132022
List ramsey numbers
N Alon, M Bucić, T Kalvari, E Kuperwasser, T Szabó
Journal of Graph Theory 96 (1), 109-128, 2021
132021
Monochromatic paths in random tournaments
M Bucić, S Letzter, B Sudakov
arXiv preprint arXiv:1703.10424, 0
12*
Towards the Erdős-Gallai cycle decomposition conjecture
M Bucić, R Montgomery
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 839-852, 2023
112023
Directed Ramsey number for trees
M Bucić, S Letzter, B Sudakov
arXiv preprint arxiv:1708.04504, 0
11*
Covering graphs by monochromatic trees and Helly-type results for hypergraphs
M Bucić, D Korándi, B Sudakov
Combinatorica 41 (3), 319-352, 2021
10*2021
Essentially tight bounds for rainbow cycles in proper edge-colourings
N Alon, M Bucić, L Sauermann, D Zakharov, O Zamir
arXiv preprint arXiv:2309.04460, 2023
92023
Minimum saturated families of sets
M Bucić, S Letzter, B Sudakov, T Tran
Bulletin of the London Mathematical Society 50 (4), 725-732, 2018
92018
Equivalence between Erdos-Hajnal and polynomial Rödl and Nikiforov conjectures
M Bucic, J Fox, HT Pham
arXiv preprint arXiv:2403.08303 3, 2024
82024
Partition problems in high dimensional boxes
M Bucic, B Lidický, J Long, AZ Wagner
Journal of Combinatorial Theory, Series A 166, 315-336, 2019
82019
Tight Ramsey bounds for multiple copies of a graph
M Bucic, B Sudakov
arXiv preprint arXiv:2108.11946, 2021
72021
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20