8 papers
Ramsey numbers of multiple copies of a graph and the random Ramsey theorem
Andrea Freschi, Ryan R. Martin, Andrew Treglown
A well-known result of Burr, ErdÅs and Spencer [Transactions of the American Mathematical Society, 1975] determines the -colour Ramsey number for any sufficiently large collect…
A general bound on
Stijn Cambie, Andrea Freschi
In this paper, we prove that for every and every graph with edges and no isolated vertices, the Ramsey number is at most . This settles a pro…
Ramsey number of a cycle versus a graph of a given size
Stijn Cambie, Andrea Freschi, Patryk Morawski +2
In this paper, we prove that for every and every graph with edges and no isolated vertices, the Ramsey number is at most ,…
Matchings avoiding ordered patterns
János Barát, Andrea Freschi, Géza Tóth
A {\it vertex-ordered} graph is a graph equipped with a linear ordering of its vertices. A pair of independent edges in an ordered graph can exhibit one of the following three patt…
Ramsey-type problems for tilings in dense graphs
József Balogh, Andrea Freschi, Andrew Treglown
Given a graph , the Ramsey number is the smallest positive integer such that every -edge-colouring of yields a monochromatic copy of . We write to de…
Typical Ramsey properties of the primes, abelian groups and other discrete structures
Andrea Freschi, Robert Hancock, Andrew Treglown
Given a matrix with integer entries, a subset of an abelian group and , we say that is -Rado if any -colouring of yields a monochromatic…