The Ramsey number for a triple of large cycles

TL;DR

This paper determines the approximate value of the Ramsey number for three large cycles, regardless of their parity, advancing understanding of cycle interactions in graph theory.

Contribution

It provides the asymptotic value of the Ramsey number for a triple of large cycles with potentially different parities, a novel result in combinatorics.

Findings

Asymptotic Ramsey number for three large cycles established

Results hold for cycles of different parity

Advances understanding of cycle interactions in graphs

Abstract

We find the asymptotic value of the Ramsey number for a triple of long cycles, where the lengths of the cycles are large but may have different parity.