A general bound on R(Ck,H)
Abstract
In this paper, we prove that for every k and every graph H with m edges and no isolated vertices, the Ramsey number R(Ck,H) is at most (k-1)m+1 km. This settles a problem of Erdős, Faudree, Rousseau and Schelp, which is listed as problem 34 in the graph theory collection.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.