Author
Nicolás Federico Galindez
Recent research
- AI & ComputingOpen access
An upper bound for the three-colour Ramsey number of the ten-cycle: R(C10,C10,C10) <= 26
We prove that R(C10, C10, C10) <= 26. The best upper bound recorded in theDynamic Survey of Small Ramsey Numbers (DS1, revision 18, April 2026) wasR3(C10) <= 3015, a specialization of a 1975 theorem of Erdos and Graham; thesurvey names R3(C10) as the first open case of Dzido's co...