A Novel Paradigm for Calculating Ramsey Number via Artificial Bee Colony Algorithm
Wei-Hao Mao, Fei Gao, Yi-Jin Dong, Wen-Ming Li

TL;DR
This paper introduces a new method using Artificial Bee Colony optimization to improve the lower bounds of the Ramsey number R(3,10), demonstrating high precision and robustness through simulations.
Contribution
It presents a novel paradigm combining ABC optimization with a mathematical model to estimate Ramsey numbers more accurately.
Findings
Reported four new r(3,9,39) graphs supporting lower bounds for R(3,10)
Demonstrated high precision and robustness of the proposed method
Achieved better approximation of the Ramsey number R(3,10)
Abstract
The Ramsey number is of vital importance in Ramsey's theorem. This paper proposed a novel methodology for constructing Ramsey graphs about R(3,10), which uses Artificial Bee Colony optimization(ABC) to raise the lower bound of Ramsey number R(3,10). The r(3,10)-graph contains two limitations, that is, neither complete graphs of order 3 nor independent sets of order 10. To resolve these limitations, a special mathematical model is put in the paradigm to convert the problems into discrete optimization whose smaller minimizers are correspondent to bigger lower bound as approximation of inf R(3,10). To demonstrate the potential of the proposed method, simulations are done to to minimize the amount of these two types of graphs. For the first time, four r(3,9,39) graphs with best approximation for inf R(3,10) are reported in simulations to support the current lower bound for R(3,10). The…
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
TopicsComputability, Logic, AI Algorithms · Optimization and Packing Problems · Numerical Methods and Algorithms
