Skip to main content

Mathematics of Ramsey Theory

  • Book
  • © 1990

Overview

Part of the book series: Algorithms and Combinatorics (AC, volume 5)

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

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (18 chapters)

  1. Introduction Ramsey Theory Old and New

  2. Classics

  3. Structural Theory

  4. Noncombinatorial Methods

  5. Variations and Applications

Keywords

About this book

One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey theory are shared by logicians, set theorists and combinatorists, and have been successfully applied in other branches of mathematics. The whole subject is quickly developing and has some new and unexpected applications in areas as remote as functional analysis and theoretical computer science. This book is a homogeneous collection of research and survey articles by leading specialists. It surveys recent activity in this diverse subject and brings the reader up to the boundary of present knowledge. It covers virtually all main approaches to the subject and suggests various problems for individual research.

Editors and Affiliations

  • Department of Applied Mathematics, Charles University, Praha 1, Czechoslovakia

    Jaroslav Nešetřil

  • Department of Mathematics and Computer Science, Emory University, Atlanta, USA

    Vojtěch Rödl

Bibliographic Information

Publish with us