The Mathematics of Paul Erdős I

Graham, Ronald L.; Nešetřil, Jaroslav; Butler, Steve

The Mathematics of Paul Erdős I

Edited by Ronald L. Graham (), Jaroslav Nešetřil () and Steve Butler ()

Date: 2013
Edition: 2nd ed. 2013
ISBN: 978-1-4614-7258-2
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Chapters in this book:

Paul Erdős: Life and Work: Béla Bollobás
Erdős Magic: Joel Spencer
Some of My Favorite Problems and Results: Paul Erdős
Integers Uniquely Represented by Certain Ternary Forms: Irving Kaplansky
Did Erdős Save Western Civilization?: Cedric A. B. Smith
Encounters with Paul Erdős: Arthur H. Stone
On Cubic Graphs of Girth at Least Five: William T. Tutte
Cross-Disjoint Pairs of Clouds in the Interval Lattice: Rudolf Ahlswede and Ning Cai
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences: Rudolf Ahlswede and Levan H. Khachatrian
Dense Difference Sets and Their Combinatorial Structure: Vitaly Bergelson, Paul Erdős, Neil Hindman and Tomasz Łuczak
Integer Sets Containing No Solution to $$x + y = 3z$$: Fan R. K. Chung and John L. Goldwasser
On Primes Recognizable in Deterministic Polynomial Time: Sergei Konyagin and Carl Pomerance
Ballot Numbers, Alternating Products, and the Erdős-Heilbronn Conjecture: Melvyn B. Nathanson
On Landau’s Function g(n): Jean-Louis Nicolas
On Divisibility Properties of Sequences of Integers: András Sárközy
On Additive Representative Functions: András Sárközy and Vera T. Sós
Arithmetical Properties of Polynomials: Andrzej Schinzel
Some Methods of Erdős Applied to Finite Arithmetic Progressions: T. N. Shorey and Robert Tijdeman
Sur la non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires: Gérald Tenenbaum
1105: First Steps in a Mysterious Quest: Gérald Tenenbaum
Games, Randomness and Algorithms: József Beck
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings: Jeff Kahn
The Origins of the Theory of Random Graphs: Michał Karoński and Andrzej Ruciński
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs: Pavel Pudlák and Jiří Sgall
How Abelian is a Finite Group?: Lásló Pyber
On Small Size Approximation Models: Alexander A. Razborov
The Erdős Existence Argument: Joel Spencer
Extension of Functional Equations: János Aczél and László Losonczi
Remarks on Penrose Tilings: N. G. de Bruijn
Distances in Convex Polygons: Peter Fishburn
Unexpected Applications of Polynomials in Combinatorics: Larry Guth
The Number of Homothetic Subsets: Miklós Laczkovich and Imre Z. Ruzsa
On Lipschitz Mappings Onto a Square: Jiří Matoušek
A Remark on Transversal Numbers: János Pach
In Praise of the Gram Matrix: Moshe Rosenfeld
On Mutually Avoiding Sets: Pavel Valtr

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprbok:978-1-4614-7258-2

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2

Access Statistics for this book

More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().