3 papers
math.CO2026
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…
math.CO2025
Notes on sum-free sets in abelian groups
Nathanaël Hassler, Andrew Treglown
In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups we asymptotically determine t…
math.CO2021
On maximal sum-free sets in abelian groups
Nathanaël Hassler, Andrew Treglown
Balogh, Liu, Sharifzadeh and Treglown [Journal of the European Mathematical Society, 2018] recently gave a sharp count on the number of maximal sum-free subsets of $\{1, \dots, n\}…