Computation of the Ramsey numbers R(C₄,K₉) and R(C₄,K₁₀)

zbMATH Open1350.05172arXiv1310.3017MaRDI QIDQ2829342FDOQ2829342

Stanisław P. Radziszowski, Alexander Lange, Ivan Livinsky

Publication date: 27 October 2016

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Abstract: The Ramsey number $R(C_4,K_m)$ is the smallest $n$ such that any graph on $n$ vertices contains a cycle of length four or an independent set of order $m$. With the help of computer algorithms we obtain the exact values of the Ramsey numbers $R(C_4,K_9)=30$ and $R(C_4,K_{10})=36$. New bounds for the next two open cases are also presented.

Full work available at URL: https://arxiv.org/abs/1310.3017

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Computation of the Ramsey numbers \(R(C_4,K_9)\) and \(R(C_4,K_{10})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829342)