Abstract
In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented. As a result, seven new lower bounds for classical Ramsey numbers are established: $R(3,13)\geq 59$, $R(4,10)\geq 80$, $R(4,11)\geq 96$, $R(4,12)\geq 106$, $R(4,13)\geq 118$, $R(4,14)\geq 129$, and $R(5,8)\geq 95$.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
