Skip to main content Accessibility help
×
Home

On the Ramsey Number r(F, K m) Where F is a Forest

  • Saul Stahl (a1)

Extract

The graphs considered here are finite and have no loops or multiple edges. In particular, Km denotes the complete graph on m vertices. For any graph G, V(G) and E(G) denote, respectively, the vertex and edge sets of G. A forest is a graph which has no cycles and a tree is a connected forest. The reader is referred to [1] or [4] for the meaning of terms not defined in this paper.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      On the Ramsey Number r(F, K m) Where F is a Forest
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      On the Ramsey Number r(F, K m) Where F is a Forest
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      On the Ramsey Number r(F, K m) Where F is a Forest
      Available formats
      ×

Copyright

References

Hide All
1. Behzad, M. and Chartrand, G., Introduction to the theory of graphs (Allyn and Bacon, Boston, 1971).
2. Burr, S. A., Generalized Ramsey theory for graphsa survey, Graphs and Combinatorics, Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University, June 18-22, 1973, 5276 (Springer-Verlag, New York, 1974).
3. Chvâtal, V., On the Ramsey numbers r(Km, T) (to appear).
4. Harary, F., Graph theory (Addison-Wesley, Reading, 1969).
5. Lick, D. R. and White, A. T., k-degenerate graphs, Can. J. Math 22 (1970), 10821096,
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

On the Ramsey Number r(F, K m) Where F is a Forest

  • Saul Stahl (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.