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

MaRDI QIDQ2829342zbMATH OpenFDO

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

Publication date 27 October 2016

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

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

Mathematics Subject Classification ID

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

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.

Recommendations

• Computation of Ramsey numbers \(R(C_m,W_n)\)
• The value of the Ramsey number \(R_4(C_4)\)
• scientific article; zbMATH DE number 1933057
• Ramsey numbers based on \(C_ 5\)-decompositions
• Ramsey numbers for unions of some cycles

Cited in

(6)

• Some upper bounds on Ramsey numbers involving C₄
• Ramsey numbers based on \(C_ 5\)-decompositions
• Computation of Ramsey numbers \(R(C_m,W_n)\)
• A note on the Ramsey numbers \(R(C_4,B_n)\)
• scientific article; zbMATH DE number 1874380 (Why is no real title available?)
• scientific article; zbMATH DE number 3882465 (Why is no real title available?)

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)