Abstract
Let r(W6) be the smallest n such that the five-spoked wheel W6 √ G or else W6 √ for every graph G with n vertices. Recently, Erdös asked whether whether r(W6) ≥ 18; we prove that 17 ≤ r(W6) ≤ 20. In so doing, we establish that r(C5, W6) = 13. We conjecture that r(W6) = 20.
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
Chartrand, G. and Schuster, S. On the Existence of Specified Cycles in Complementary Graphs. Bull. Amer. Math. Soc., 77 (1971) 995–998.
Chvátal, V. and Harary, F. Generalized Ramsey Theory for Graphs. Bull. Amer. Math. Soc. 78 (1972) 423–426.
Chvátal, V. and Harary, F., Generalized Ramsey Theory for Graphs, I. Diagonal Numbers. Periodica Math. Hungar. 3 (1973) 115–124.
Dirac, G. A. A Property of 4-chromatic Graphs and Some Remarks on Critical Graphs. J. London Math. Soc. 27 (1952) 85–92.
Erdös, P. Some Remarks on the Theory of Graphs. Bull. Amer. Math. Soc. 53 (1947) 292–294.
Greenwood, R. E. and Gleason, A. M. Combinatorial Relations and Chromatic Graphs. Canad. J. Math. 7 (1955) 1–7.
Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.
Ramsey, F. P. On a Problem of Formal Logic. Proc. London Math. Soc. 30 (1930) 264–286.
Schwenk, A. J. Acquaintance Graph Party Problem. Amer. Math. Monthly 79 (1972) 1113–1117.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin
About this paper
Cite this paper
Chvátal, V., Schwenk, A. (1974). On the ramsey number of the five-spoked wheel. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066447
Download citation
DOI: https://doi.org/10.1007/BFb0066447
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06854-9
Online ISBN: 978-3-540-37809-9
eBook Packages: Springer Book Archive