20 citations · 64 across the 12 of their papers we have counts for
5 papers · 1 filter
Erdős-Szekeres theorem for multidimensional arrays
M. Bucić, B. Sudakov, T. Tran
The classical Erdős-Szekeres theorem dating back almost a hundred years states that any sequence of distinct real numbers contains a monotone subsequence of length .…
Perfect matchings and derangements on graphs
Matija Bucic, Pat Devlin, Mo Hendon +2
We show that each perfect matching in a bipartite graph intersects at least half of the perfect matchings in . This result has equivalent formulations in terms of the perman…
List Ramsey numbers
N. Alon, M. Bucić, T. Kalvari +2
We introduce the list colouring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each oth…
Covering graphs by monochromatic trees and Helly-type results for hypergraphs
Matija Bucić, Dániel Korándi, Benny Sudakov
How many monochromatic paths, cycles or general trees does one need to cover all vertices of a given -edge-coloured graph ? These problems were introduced in the 1960s and we…
Multicolour bipartite Ramsey number of paths
Matija Bucic, Shoham Letzter, Benny Sudakov
The -colour bipartite Ramsey number of a bipartite graph is the least integer for which every -edge-coloured complete bipartite graph contains a monochromat…