×

The Ramsey number for a cycle of length five vs. a complete graph of order six. (English) Zbl 0969.05044

The authors show that the Ramsey number \(r(C_5, K_6)\) is equal to 21. In the end of their paper in a note added in proof the authors state that they were informed by Yang Jian Sheng that \(r(C_m, K_6)= 5m- 4\) for all \(m\geq 5\) has been proved.

MSC:

05C55 Generalized Ramsey theory
05C38 Paths and cycles

Keywords:

cycle; Ramsey number
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bollob?s, Australas J Combin
[2] Bondy, J Combin Theory Ser B 14 pp 46– (1973) · Zbl 0248.05127 · doi:10.1016/S0095-8956(73)80005-X
[3] Caro, Discrete Math
[4] Clancy, J Graph Theory 1 pp 89– (1977) · Zbl 0351.05121 · doi:10.1002/jgt.3190010117
[5] Erd?s, J Graph Theory 2 pp 53– (1978) · Zbl 0383.05027 · doi:10.1002/jgt.3190020107
[6] and ?Problems in graph theory from Memphis,? The mathematics of Paul Erd?s, II, and (Editors), Springer-Verlag, Berlin, 1997, pp. 7-26.
[7] Faudree, Discrete Math 8 pp 313– (1974) · Zbl 0294.05122 · doi:10.1016/0012-365X(74)90151-4
[8] Hendry, J Graph Theory 13 pp 245– (1989) · Zbl 0676.05062 · doi:10.1002/jgt.3190130210
[9] Radziszowski, Elec J Combin 1 pp ds1– (1994)
[10] Rousseau, Cong Number 123 pp 97– (1997)
[11] and ?Some problems in Ramsey theory,? Theory and applications of graphs, and (Editors), Lecture Notes in Math 642, Springer-Verlag, Berlin, 1978, pp. 500-515.
[12] and r(Cn, K4) = 3 (n ? 1) + 1 (n ? 4), (preprint).
[13] Spencer, Discrete Math 20 pp 69– (1977) · Zbl 0375.05033 · doi:10.1016/0012-365X(77)90044-9
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.