On size Ramsey numbers for a pair of cycles
Ma{\l}gorzata Bednarska-Bzd\k{e}ga, Tomasz {\L}uczak

TL;DR
This paper establishes an upper bound on the size Ramsey number for pairs of cycles, specifically showing it is linearly bounded by the cycle length, and explores related restricted size Ramsey numbers.
Contribution
The paper proves a linear upper bound on the size Ramsey number for pairs of cycles and investigates the restricted size Ramsey number for these pairs.
Findings
Size Ramsey number for pairs of cycles is linearly bounded by cycle length.
Existence of an absolute constant A bounding the size Ramsey number.
Analysis of restricted size Ramsey numbers for cycle pairs.
Abstract
We show that there exists an absolute constant such that the size Ramsey number of a pair of cycles , , where , is bounded from above by . We also study the restricted size Ramsey number for such a pair.
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
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Computability, Logic, AI Algorithms
