A Tribute to Paul ErdosThis volume is dedicated to Paul Erdos, who has profoundly influenced mathematics in this century, with over 1200 papers on number theory, complex analysis, probability theory, geometry, interpretation theory, algebra set theory and combinatorics. One of Erdos' hallmarks is the host of stimulating problems and conjectures, to many of which he has attached monetary prices, in accordance with their notoriety. A feature of this volume is a collection of some fifty outstanding unsolved problems, together with their "values." |
Contents
Sumfree subsets | 13 |
Is there a different proof of the ErdősRado theorem? | 27 |
Hamilton cycles in random graphs of minimal degree at least | 59 |
Béla Bollobás T I Fenner A M Frieze 59 | 94 |
On graphs not containing prescribed induced subgraphs | 111 |
A compact sequential space | 153 |
Locally finite groups of permutations of N acting on 1⁰⁰ | 195 |
On the number of certain subgraphs of graphs without large | 223 |
On σcentered posets | 307 |
On the ErdősFuchs theorems | 331 |
Special Lucas sequences including the Fibonacci sequence | 349 |
Graphs with no unfriendly partitions | 373 |
Sperner Turan and Bregman revisited | 391 |
Sur une question dErdős et Schinzel | 405 |
Large apreserving sets in infinite aconnected graphs | 445 |
Partitioning the quadruples of topological spaces | 459 |
Sets of multiples of Behrend sequences | 249 |
The differences between consecutive primes IV | 277 |
Other editions - View all
Common terms and phrases
a-connected a₁ Abelian group assume B₁ Bollobás choose chromatic number cofinal complete graph completes the proof condition conjecture constant construction contains contradiction convergence Corollary countable d'après d'où deduce define denote disjoint edges elements entiers ER-function Erdős exists finite fixed follows function g G₁ graph G h₁ Hajnal Hamilton cycles Hence holds hypergraph implies induced subgraphs induction inequality infinite integers interpolation isomorphic l'on least Lemma lemme Let G limit ordinal log log logn Martin's axiom Math modp nombre non-trivial non-zero number theory obtain ordinal pairs partition Paul Erdős permutations polynomials prime problem proof of Lemma proof of Theorem Proposition prove random graphs regular cardinal result satisfies Section subgraph sum-free supp(da Suppose Theorem 3.1 théorème tion uncountable upper bound vertex set vertices w₁ w₂ Σ Σ