A note on two multicolor Ramsey numbers

MaRDI QIDQ2571307zbMATH OpenFDO

Authors Alexander Engström

Publication date 1 November 2005

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125243, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1n14.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

four-coloring

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Review text

The bulk of this paper consists of a presentation of a four-coloring of \(K_{26}\), which shows that 26 is a lower bound for \(R(K_3,K_4,C_3,C_3)\). A brief paragraph at the end uses a result of \textit{C. R. J. Clapham, A. Flockhart} and \textit{J. Sheehan} [J. Graph Theory 13, 29--47 (1989; Zbl 0679.05043)] to show that \(R_4(C_4)\leq 19\).

Recommendations

• scientific article; zbMATH DE number 2197899
• A bound for multicolor Ramsey numbers
• Note on the multicolour size-Ramsey number for paths
• Multicolored Ramsey numbers in multipartite graphs
• A note on Ramsey numbers with two parameters
• On the multi-colored Ramsey numbers of cycles
• Multicolor Ramsey numbers for some paths and cycles
• On multicolor Ramsey numbers and subset coloring of hypergraphs
• Multi-color Ramsey numbers of even cycles
• On the multi-colored Ramsey numbers of paths and even cycles

Cited in

(7)

• Two remarks on the coloring number
• Note on the multicolour size-Ramsey number for paths
• An application of splittable 4-frames to coloring of \(K_{n,n}\)
• On the four color Ramsey numbers for hexagons.
• 28 R(C₄,C₄,C₃,C₃) 36
• Upper bounds on the multicolor Ramsey numbers \(r_k (C_4)\)
• Set partition complexes

This page was built for publication: A note on two multicolor Ramsey numbers

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