1 citations · 1 across the 12 of their papers we have counts for
14 papers
Rainbow connecting -colorings of super-Dirac graphs
János Barát, Simona Boyadzhiyska, Andrea Freschi
Let be a graph with minimum degree . Can we color the edges of with red and blue so that every pair of non-adjacent vertices is connected by a path consist…
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 collecti…
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…
A note on improved bounds for hypergraph rainbow matching problems
Candida Bowtell, Andrea Freschi, Gal Kronenberg +1
A natural question, inspired by the famous Ryser-Brualdi-Stein Conjecture, is to determine the largest positive integer such that every collection of matchings, each o…
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…
The asymptotic behaviour of
Asier Calbet, Andrea Freschi
For a family of graphs, is the minimum number of edges in a graph on vertices which does not contain any of the graphs in b…
An oriented discrepancy version of Dirac's theorem
Andrea Freschi, Allan Lo
The study of graph discrepancy problems, initiated by Erdős in the 1960s, has received renewed attention in recent years. In general, given a -edge-coloured graph , one is in…
The induced saturation problem for posets
Andrea Freschi, Simón Piga, Maryam Sharifzadeh +1
For a fixed poset , a family of subsets of is induced -saturated if does not contain an induced copy of , but for every subset of …
Dirac-type results for tilings and coverings in ordered graphs
Andrea Freschi, Andrew Treglown
A recent paper of Balogh, Li and Treglown initiated the study of Dirac-type problems for ordered graphs. In this paper we prove a number of results in this area. In particular, we…
On deficiency problems for graphs
Andrea Freschi, Joseph Hyde, Andrew Treglown
Motivated by analogous questions in the setting of Steiner triple systems and Latin squares, Nenadov, Sudakov and Wagner [Completion and deficiency problems, Journal of Combinatori…
A note on colour-bias Hamilton cycles in dense graphs
Andrea Freschi, Joseph Hyde, Joanna Lada +1
Balogh, Csaba, Jing and Pluhár recently determined the minimum degree threshold that ensures a -coloured graph contains a Hamilton cycle of significant colour bias (i.e., a…