Advertisement

Introduction

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

Abstract

Paul Erdős was always interested in infinity. One of his earliest results is an infinite analogue of (the then very recent) Menger’ s theorem (which was included in a classical book of his teacher Denes König). Two out of his earliest three combinatorial papers are devoted to infinite graphs. According to his personal recollections, Erdős always had an interest in “large cardinals” although his earliest work on this subject are joint papers with A. Tarski from the end of thirties. These interests evolved over the years into the Giant Triple Paper, with the Partition Calculus forming a field rightly called here Erdősian Set Theory.

Keywords

Complete Graph Chromatic Number Large Cardinal Classical Book Joint Paper 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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