Advertisement

Introduction

  • Ronald L. Graham
  • Jaroslav Nešetřil
Part of the Algorithms and Combinatorics book series (AC, volume 14)

Abstract

It is perhaps evident from several places of this volume that Ramsey theorem played a decisive role in Erdős’ combinatorial activity. And perhaps no other part of combinatorial mathematics is so dear to him as Ramsey theory and extremal problems. He was not creating or even aiming for a theory. However, a complex web of results and conjectures did, in fact, give rise to several theories. They all started with modest short papers by Erdős, Szekeres and Turán in the thirties. How striking it is to compare these initial papers with the richness of the later development, described, E.g., by the survey articles of Miki Simonovits (extremal graph theory) and Jeff Kahn (extremal set theory). In addition, the editors of these volumes tried to cover in greater detail the development of Ramsey theory mirrored and motivated by Erdős’ papers. In a way (and this certainly is one of the leitmotivs of Erdős’ work), there is little difference between, say, density Ramsey type results and extremal problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Ronald L. Graham
    • 1
  • Jaroslav Nešetřil
    • 2
  1. 1.AT&T Bell LaboratoriesMurray HillUSA
  2. 2.Department of Applied MathematicsCharles UniversityPrahaCzech Republic

Personalised recommendations