A Tribute to Paul Erdos

doi:10.1017/CBO9780511983917

- Get access
  
  Buy a print copy
  
  Check if you have access via personal or institutional login
  
  Log in Register
Cited by 1
Cited by
- 1
Crossref Citations

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Schlickewei, Hans Peter 2008. Diophantine Approximation. Vol. 16, Issue. , p. 1.

CrossRef

Google Scholar

Edited by A. Baker, Trinity College, Cambridge, B. Bollobás, Trinity College, Cambridge, A. Hajnal

Publisher:: Cambridge University Press
Online publication date:: March 2012
Print publication year:: 1990
Online ISBN:: 9780511983917
DOI:: https://doi.org/10.1017/CBO9780511983917

Subjects:: Mathematics, Logic, Categories and Sets, Discrete Mathematics Information Theory and Coding

67.99 (USD)

Digital access for individuals
(PDF download and/or read online)
Add to cart

Added to cart

Digital access for individuals
(PDF download and/or read online)
View cart
Export citation
Buy a print copy

Information

Contents

Metrics

This volume is dedicated to Paul Erdos, who profoundly influenced mathematics in the twentieth century, with over 1200 papers in number theory, complex analysis, probability theory, geometry, interpretation theory, algebra set theory and combinatorics. One of Erdos' hallmarks was the host of stimulating problems and conjectures, to many of which he attached monetary prices, in accordance with their notoriety. A feature of this volume is a collection of some 50 outstanding unsolved problems, together with their 'value'! Eminent mathematicians from around the world have contributed articles to this volume that reflect the diversity of Erdos' interests, and it will be a fund of insight for number theorists, combinatorialists, set theorists and analysts.

- Aa Reduce text
- Aa Enlarge text

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
To save content items to your account, please 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 account. Find out more about saving content to .

To save content items to your Kindle, first ensure [email protected] 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 saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved 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.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

Page 1 of 2

First
« Prev
1
2
Next »
Last

Contents

Frontmatter
pp i-iv
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Contents
pp v-viii
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Preface
pp ix-x
- By Alan Baker, Béla Bollobás, András Hajnal
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

List of contributors
pp xi-xvi
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Acknowlegements
pp xvii-xviii
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Generating expanders from two permutations
pp 1-12
- By Miklós Ajtai, IBM San Jose Research Laboratory, János Komlós, Rutgers University, Endre Szemerédi, Rutgers University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Sum-free subsets
pp 13-26
- By N. Alon, Tel Aviv University, D. J. Kleitman, M.I.T.
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Is there a different proof of the Erdős-Rado theorem?
pp 27-38
- By James E. Baumgartner, Dartmouth College
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Almost collinear triples among N points on the plane
pp 39-58
- By József Beck, Rutgers University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Hamilton cycles in random graphs of minimal degree at least k
pp 59-96
- By Béla Bollobás, University of Cambridge, T. I. Fenner, Birkbeck College, A. M. Frieze, Carnegie Mellon University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

The circumference of a graph with a given minimal degree
pp 97-104
- By Béla Bollobás, University of Cambridge, Roland Hággkvist, Stockholms Universitet
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On arithmetic progressions in sums of sets of integers
pp 105-110
- By J. Bourgain, Institut des Hautes Étude Scientifiques
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On graphs not containing prescribed induced subgraphs
pp 111-120
- By F. R. K. Chung, Bell Communications Research, R. L. Graham, AT&T Bell Laboratories
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Partitions sans petits sommants
pp 121-152
- By Jacques Dixmier, Jean-Louis Nicolas, Université Claude Bernard
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A compact sequential space
pp 153-160
- By Alan Dow, York University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

The critical parameter for connectedness of some random graphs
pp 161-176
- By R. Durrett, Cornell University, H. Kesten, Cornell University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Multiplicative functions on arithmetic progressions: III. The large moduli
pp 177-194
- By P. D. T. A. Elliott, University of Colorado at Boulder
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Locally finite groups of permutations of ℕ acting on l∞
pp 195-200
- By Matthew Foreman, Ohio State University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Hypergraph games and the chromatic number
pp 201-206
- By Fred Galvin, University of Kansas
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On arithmetic graphs associated with integral domains
pp 207-222
- By K. Győry, University of Debrecen
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On the number of certain subgraphs of graphs without large cliques and independent subsets
pp 223-248
- By A. Hajnal, Mathematical Institute of the Hungarian Academy of Sciences, Z. Nagy, Mathematical Institute of the Hungarian Academy of Sciences, L. Soukup, Mathematical Institute of the Hungarian Academy of Sciences
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Sets of multiples of Behrend sequences
pp 249-258
- By R. R. Hall, University of York
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A functional equation arising from mortality tables
pp 259-276
- By W. K. Hayman, University of York, A. R. Thatcher
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

The differences between consecutive primes, IV
pp 277-288
- By D. R. Heath-Brown, Magdalen College
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On the cofinality of countable products of cardinal numbers
pp 289-306
- By Thomas Jech, Pennsylvania State University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On σ-centered posets
pp 307-312
- By I. Juhász, Mathematical Institute of the Hungarian Academy of Sciences, K. Kunen, University of Wisconsin
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A Galvin–Hajnal conjecture on uncountably chromatic graphs
pp 313-316
- By P. Komjáth, Eőtvős Loránd University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Necessary conditions for mean convergence of Hermite–Fejér interpolation
pp 317-330
- By Attila Máté, Brooklyn College of CUNY, Paul Nevai, Ohio State University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On the Erdős–Fuchs theorems
pp 331-338
- By H. L. Montgomery, University of Michigan, R. C. Vaughan, Imperial College of Science and Technology
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A tournament which is not finitely representable
pp 339-340
- By Z. Nagy, Mathematical Institute of the Hungarian Academy of Sciences, Z. Szentmiklóssy, Mathematical Institute of the Hungarian Academy of Sciences
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Page 1 of 2

First
« Prev
1
2
Next »
Last

Metrics

Altmetric attention score

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

Total 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.

A Tribute to Paul Erdos

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-iv

Contents
pp v-viii

Preface
pp ix-x

List of contributors
pp xi-xvi

Acknowlegements
pp xvii-xviii

Generating expanders from two permutations
pp 1-12

Sum-free subsets
pp 13-26

Is there a different proof of the Erdős-Rado theorem?
pp 27-38

Almost collinear triples among N points on the plane
pp 39-58

Hamilton cycles in random graphs of minimal degree at least k
pp 59-96

The circumference of a graph with a given minimal degree
pp 97-104

On arithmetic progressions in sums of sets of integers
pp 105-110

On graphs not containing prescribed induced subgraphs
pp 111-120

Partitions sans petits sommants
pp 121-152

A compact sequential space
pp 153-160

The critical parameter for connectedness of some random graphs
pp 161-176

Multiplicative functions on arithmetic progressions: III. The large moduli
pp 177-194

Locally finite groups of permutations of ℕ acting on l∞
pp 195-200

Hypergraph games and the chromatic number
pp 201-206

On arithmetic graphs associated with integral domains
pp 207-222

On the number of certain subgraphs of graphs without large cliques and independent subsets
pp 223-248

Sets of multiples of Behrend sequences
pp 249-258

A functional equation arising from mortality tables
pp 259-276

The differences between consecutive primes, IV
pp 277-288

On the cofinality of countable products of cardinal numbers
pp 289-306

On σ-centered posets
pp 307-312

A Galvin–Hajnal conjecture on uncountably chromatic graphs
pp 313-316

Necessary conditions for mean convergence of Hermite–Fejér interpolation
pp 317-330

On the Erdős–Fuchs theorems
pp 331-338

A tournament which is not finitely representable
pp 339-340

Metrics

Altmetric attention score

Full text views

Book summary page views

A Tribute to Paul Erdos

Book description

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Altmetric attention score

Full text views

Book summary page views