Abstract
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every graph F of n vertices satisfies the following property: either F contains G or the complement of F contains H. In this paper, we show that the Ramsey number \(R(C_4, W_m) \leq m + \lceil \frac{m}{3} \rceil +1\) for m ≥ 6.
AMS Subject Classifications: 05C55, 05D10.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burr, S.A., Erdös, P.: Generalization of a Ramsey-Theoretic Result of Chvátal. Journal of Graph Theory 7, 39–51 (1983)
Chvátal, V.: Tree-Complete Graph Ramsey Numbers. Journal of Graph Theory 1, 93 (1977)
Chvátal, V., Harary, F.: Generalized Ramsey Theory for Graphs, III: Small off-Diagonal Numbers. Pacific Journal of Mathematics 41, 335–345 (1972)
Radziszowski, S.P.: Small Ramsey Numbers. The Electronic Journal of Combinatorics #DS1.9, (July 2002), http://www.combinatorics.org/
Radziszowski, S.P., Xia, J.: Paths, Cycles and Wheels without Antitriangles. Australasian Journal of Combinatorics 9, 221–232 (1994)
Surahmat, Baskoro, E.T., Nababan, S.M.: The Ramsey Numbers for a Cycle of Length Four versus a Small Wheel. In: Proceeding of the Eleventh National Conference on Mathematics, Universitas Negeri Malang, Indonesia, July 22-25, pp. 172–178 (2002)
Tse, K.-K.: On the Ramsey Number of the Quadrilateral versus the Book and the Wheel. Australasian Journal of Combinatorics 27, 163–168 (2003)
Lu, Z.H.: The Ramsey Number of an Odd Cycles with Respect to a Wheel (in Chinese). Journal of Mathematics, Shuxu Zazhi (Wuhan) 15, 119–120 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Surahmat, Baskoro, E.T., Uttunggadewa, S., Broersma, H. (2005). An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds) Combinatorial Geometry and Graph Theory. IJCCGGT 2003. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30540-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30540-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24401-1
Online ISBN: 978-3-540-30540-8
eBook Packages: Computer ScienceComputer Science (R0)