Abstract
In this paper, we consider the on-line Ramsey numbers $\overline{\cal R} (k,l)$ for cliques. Using a high performance computing networks, we 'calculated' that $\overline{\cal R}(3,4)=17$. We also present an upper bound of $\overline{\cal R}(k,l)$, study its asymptotic behaviour, and state some open problems.
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.
