Indexed metadata

Decay-Ramsey Sequences

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

Source record

Source: arXiv

Published: Oct 14, 2026

arXiv: 2610.20577

Open original source ↗

Source abstract

Given a sequence a=(ai)i≥1\mathbf{a}=(a_i)_{i\geq 1} of positive real numbers, we say that a colouring c:E(Kn)→Nc:E(K_n)\to \mathbb{N} is a\mathbf{a}-bounded if the proportion of edges coloured ii is at most aia_i, for all ii. We write a → Kk \mathbf{a}\, \to\, K_k if, for all sufficiently large nn, all a\mathbf{a}-bounded colourings c:E(Kn)→Nc:E(K_n)\to \mathbb{N} contain a monochromatic KkK_k. We say that the sequence a\mathbf{a} is \emph{Decay-Ramsey} if a→Kk\mathbf{a}\to K_k for all k≥2k\ge 2. In this short paper we introduce the question of determining which sequences are Decay-Ramsey and present some initial results.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Decay-Ramsey Sequences — Mathematical Frontier Network