Ramsey size linear and generalization

Read full text Summarise with VIRAT
Authors: Eng Keat Hng, Meng Ji, Ander Lamaison
Cited by: 0
References: 11

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

More than thirty years ago, Erdős, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant $c_k$ such that $r(C_{2k+1}, G) \le c_k m$ for any graph $G$ with $m$ edges and no isolated vertices? In this paper, we make a significant step towards answering this question by proving that $r(C_{2k+1}, G) \le (2 + o(1)) m + p,$ where $p$ denotes the number of vertices in $G$. Additionally, we extend the work of Goddard and Kleitman and independently Sidorenko, who proved that $r(K_3, G) \le 2m + 1$ for any graph $G$ with $m$ edges and no isolated vertices. We generalize their findings to the clique version, establishing that $r(K_r, G) \le c_r m^{(r-1)/2}$, and to the multicolor setting, showing that $r_{k+1}(K_3; G) \le c_k m^{(k+1)/2}.$

Fields of Study & Subjects

Limits and Structures in Graph Theory Advanced Combinatorial Mathematics Analytic Number Theory Research

Publication details

Journal / source
arXiv (Cornell University)
Publication date
26 March 2026
Language
EN
Document type
Preprint