Decay-Ramsey Sequences
Francesco Di Braccio, Simon Griffiths, Pedram Noohi, Leo Versteegen
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
Related papers
Hypergraphs with the smallest Hall ratio are still hard to colour
Veronica Bitonti, Freddie Illingworth, Pedram Noohi et al.
The k-color poset Ramsey number of the diamond is 2k
Tom Bohman, Will Cong, Quentin Dubroff et al.
Intersecting families of loose spanning hypertrees
Yury Person, Thomas Schweser
The terminal leave in random greedy hypergraph matching
Peter Keevash
Two Perfect One-Factorizations of K92
Tomasz Maciosowski
Treewidth and the Product of Tree-Independence and Tree-Chromatic Numbers
Xinheng Lin