Skip to main content
SpringerLink
Log in

On the ramsey number of the five-spoked wheel

  • Part III: Contributed Papers New Results On Graphs And Combinatorics
  • Conference paper
  • First Online:
Graphs and Combinatorics

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 406))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chartrand, G. and Schuster, S. On the Existence of Specified Cycles in Complementary Graphs. Bull. Amer. Math. Soc., 77 (1971) 995–998.

    Article  MathSciNet  MATH  Google Scholar 

  2. Chvátal, V. and Harary, F. Generalized Ramsey Theory for Graphs. Bull. Amer. Math. Soc. 78 (1972) 423–426.

    Article  MathSciNet  MATH  Google Scholar 

  3. Chvátal, V. and Harary, F., Generalized Ramsey Theory for Graphs, I. Diagonal Numbers. Periodica Math. Hungar. 3 (1973) 115–124.

    Article  MATH  Google Scholar 

  4. Dirac, G. A. A Property of 4-chromatic Graphs and Some Remarks on Critical Graphs. J. London Math. Soc. 27 (1952) 85–92.

    Article  MathSciNet  MATH  Google Scholar 

  5. Erdös, P. Some Remarks on the Theory of Graphs. Bull. Amer. Math. Soc. 53 (1947) 292–294.

    Article  MathSciNet  MATH  Google Scholar 

  6. Greenwood, R. E. and Gleason, A. M. Combinatorial Relations and Chromatic Graphs. Canad. J. Math. 7 (1955) 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  7. Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  8. Ramsey, F. P. On a Problem of Formal Logic. Proc. London Math. Soc. 30 (1930) 264–286.

    Article  MathSciNet  Google Scholar 

  9. Schwenk, A. J. Acquaintance Graph Party Problem. Amer. Math. Monthly 79 (1972) 1113–1117.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Montréal, Canada

    V. Chvátal

  2. University of Michigan, USA

    A. Schwenk

  3. Oxford University, UK

    A. Schwenk

Authors
  1. V. Chvátal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Schwenk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ruth A. Bari Frank Harary

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation