default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Mathematics of Paul Erdős I, 2013
- Ronald L. Graham, Jaroslav Nesetril
, Steve Butler:
The Mathematics of Paul Erdős I. Springer 2013, ISBN 978-1-4614-7257-5 - Béla Bollobás:
Paul Erdős: Life and Work. 1-41 - Joel Spencer:
Erdős Magic. 43-46 - Paul Erdös:
Some of My Favorite Problems and Results. 51-70 - Irving Kaplansky:
Integers Uniquely Represented by Certain Ternary Forms. 71-79 - Cedric A. B. Smith:
Did Erdős Save Western Civilization? 81-92 - Arthur H. Stone:
Encounters with Paul Erdős. 93-98 - William T. Tutte:
On Cubic Graphs of Girth at Least Five. 99-101 - Rudolf Ahlswede, Ning Cai:
Cross-Disjoint Pairs of Clouds in the Interval Lattice. 107-117 - Rudolf Ahlswede, Levan H. Khachatrian:
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences. 119-132 - Vitaly Bergelson, Paul Erdös, Neil Hindman, Tomasz Luczak:
Dense Difference Sets and Their Combinatorial Structure. 133-146 - Fan R. K. Chung, John L. Goldwasser:
Integer Sets Containing No Solution to x + y = 3z. 147-157 - Sergei Konyagin, Carl Pomerance:
On Primes Recognizable in Deterministic Polynomial Time. 159-186 - Melvyn B. Nathanson:
Ballot Numbers, Alternating Products, and the Erdős-Heilbronn Conjecture. 187-205 - Jean-Louis Nicolas:
On Landau's Function g(n). 207-220 - András Sárközy:
On Divisibility Properties of Sequences of Integers. 221-232 - András Sárközy, Vera T. Sós:
On Additive Representative Functions. 233-262 - Andrzej Schinzel:
Arithmetical Properties of Polynomials. 263-267 - T. N. Shorey, Robert Tijdeman:
Some Methods of Erdős Applied to Finite Arithmetic Progressions. 269-287 - Gérald Tenenbaum:
Sur la non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires. 289-300 - Gérald Tenenbaum:
1105: First Steps in a Mysterious Quest. 301-308 - József Beck:
Games, Randomness and Algorithms. 311-342 - Jeff Kahn:
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings. 343-369 - Michal Karonski, Andrzej Rucinski:
The Origins of the Theory of Random Graphs. 371-397 - Pavel Pudlák, Jirí Sgall:
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs. 399-407 - László Pyber:
How Abelian is a Finite Group? 409-423 - Alexander A. Razborov:
On Small Size Approximation Models. 425-433 - Joel Spencer:
The Erdős Existence Argument. 435-444 - János Aczél, László Losonczi:
Extension of Functional Equations. 447-459 - N. G. de Bruijn:
Remarks on Penrose Tilings. 461-481 - Peter C. Fishburn:
Distances in Convex Polygons. 483-492 - Larry Guth:
Unexpected Applications of Polynomials in Combinatorics. 493-522 - Miklós Laczkovich, Imre Z. Ruzsa:
The Number of Homothetic Subsets. 523-532 - Jirí Matousek:
On Lipschitz Mappings Onto a Square. 533-540 - János Pach:
A Remark on Transversal Numbers. 541-549 - Moshe Rosenfeld:
In Praise of the Gram Matrix. 551-557 - Pavel Valtr:
On Mutually Avoiding Sets. 559-563
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-22 19:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
