Ramsey numbers with prescribed rate of growth
Mat\'ias Pavez-Sign\'e, Sim\'on Piga, Nicol\'as Sanhueza-Matamala

TL;DR
This paper constructs sequences of graphs with prescribed growth rates of their Ramsey numbers, demonstrating the flexibility of Ramsey number growth in graphs but not in higher uniform hypergraphs, and addressing a question about multi-color Ramsey numbers.
Contribution
It proves the existence of graph sequences with Ramsey numbers growing at any prescribed rate within bounds, and shows such a result does not extend to hypergraphs of uniformity at least 5.
Findings
Constructed graph sequences with Ramsey numbers matching any non-decreasing function up to R(K_n)
Demonstrated the non-existence of similar sequences for certain hypergraphs
Answered a question about differing growth rates of 2-color and 3-color Ramsey numbers
Abstract
Let be the two-colour Ramsey number of a graph . In this note, we prove that for any non-decreasing function , there exists a sequence of connected graphs , with for all , such that . In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least . We also use our techniques to answer a question posed by DeBiasio about the existence of sequences of graphs whose -colour Ramsey number is linear whereas their -colour Ramsey number has superlinear growth.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory
