## 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." |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Sumfree subsets | 13 |

Is there a different proof of the ErdosRado theorem? | 27 |

Hamilton cycles in random graphs of minimal degree at least | 59 |

The circumference of a graph with a given minimal degree | 97 |

On graphs not containing prescribed induced subgraphs | 111 |

A compact sequential space | 153 |

Locally finite groups of permutations of M acting on | 195 |

On the number of certain subgraphs of graphs without large | 223 |

On a centered posets | 307 |

On the ErdosFuchs 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 dErdos 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 Abelian group assume Bollobas choose Chr(G chromatic number cofinal compact complete graph completes the proof condition conjecture connected constant construction contains contradiction convergence Corollary countable d'apres d'ou deduce define degree at least denote Department of Mathematics disjoint edges elements entiers equation ER-function Erdfis Erdos exists finite fixed follows function graph G Hajnal Hamilton cycles Hence holds homogeneous hypergraph implies induced subgraphs induction inequality infinite integers interpolation isomorphic Lagrange interpolation Lemma lemme Let G limit ordinal log log logn Martin's axiom Math matrix minimal degree multiplicative nombre non-trivial non-zero notation number theory obtain orthogonal polynomials pairs partition Paul Erdos permutations polynomials poset premiers prime problem Proof Let proof of Lemma proof of Theorem Proposition prove random graphs regular cardinal result satisfies Section sequential space solution subgraph sum-free sum-free subset Suppose Theorem 3.1 tion uncountable uniformly upper bound vertex set vertices