Skip to content

Decay-Ramsey Sequences

Francesco Di Braccio, Simon Griffiths, Pedram Noohi, Leo Versteegen

math.COarXiv:2610.20577

Abstract

Given a sequence a=(ai)i≥ 1 of positive real numbers, we say that a colouring c:E(Kn) N is a-bounded if the proportion of edges coloured i is at most ai, for all i. We write \[ a\, \, Kk \] if, for all sufficiently large n, all a-bounded colourings c:E(Kn) N contain a monochromatic Kk. We say that the sequence a is Decay-Ramsey if a Kk for all k 2. In this short paper we introduce the question of determining which sequences are Decay-Ramsey and present some initial results.

Create a lesson