This site uses cookies to deliver our services, improve performance, for analytics, and (if not signed in) for advertising. By using LibraryThing you acknowledge that you have read and understand our Terms of Service and Privacy Policy. Your use of the site and services is subject to these policies and terms.
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Rudiments of Ramsey Theory (Cbms Regional…

Rudiments of Ramsey Theory (Cbms Regional Conference Series in…

by Ronald L. Graham

MembersReviewsPopularityAverage ratingConversations
Recently added byhmcmath, Galizur, clamp, peterdmark



Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
Important places
Important events
Related movies
Awards and honors
First words
Last words
Disambiguation notice
Publisher's editors
Publisher series
Original language

References to this work on external resources.

Wikipedia in English


Book description
Haiku summary

Amazon.com Product Description (ISBN 0821816969, Paperback)

It is no exaggeration to say that within the past several years there has been a veritable explosion of activity in the general field of combinatorics. Within this domain, one particular subject has enjoyed even more remarkable growth. This subject is Ramsey theory, the topic of these lecture notes. The notes are based rather closely on lectures given at a Regional Conference at St. Olaf College in June, 1979. It was the purpose of the lectures to develop the background necessary for an understanding of these recent developments in Ramsey theory. In keeping with the style of the lectures, the notes are informal. However, complete proofs are given for most of the basic results presented. In addition, many useful results may be found in the exercises and problems.

Loosely speaking, Ramsey theory is that branch of combinatorics which deals with structure which is preserved under partitions. Typically one looks at the following kind of question: If a particular structure (e.g., algebraic, combinatorial or geometric) is arbitrarily partitioned into finitely many classes, what kinds of substructures must always remain intact in at least one of the classes?

During the past few years, a number of spectacular advances have been made in the field of Ramsey theory. These include, for example, the work of Szemerédi and Furstenberg settling the venerable conjecture of Erdös and Turán (that a set of integers with no k-term arithmetic progression must have density zero), the Nesetril-Rödl theorems on induced Ramsey properties, the results of Paris and Harrington on "large" Ramsey numbers and undecidability in first-order Peano arithmetic, Deuber's solution to the old partition regularity conjecture of Rado, Hindman's surprising generalization of Schur's theorem, and the resolution of Rota's conjecture on Ramsey's theorem for vector spaces by Graham, Leeb and Rothschild. It has also become apparent that the ideas and techniques of Ramsey theory span a rather broad range of mathematical areas, interacting in essential ways with parts of set theory, graph theory, combinatorial number theory, probability theory, analysis and even theoretical computer science.

It is the purpose of these lecture notes to lay the foundation on which much of this recent work is based. Most of what is covered here is treated in considerably more detail in the recent monograph Ramsey theory by Graham, Rothschild and Spencer.

Relatively little specialized mathematical background is required for this book. It should be accessible to upper division students.

(Published with support from the National Science Foundation)

(retrieved from Amazon Thu, 12 Mar 2015 18:19:35 -0400)

No library descriptions found.

Quick Links

Popular covers


Average: No ratings.

Is this you?

Become a LibraryThing Author.


About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 126,457,917 books! | Top bar: Always visible