A Tribute to Paul Erdos
This 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.
Is there a different proof of the ErdosRado theorem?
Hamilton cycles in random graphs of minimal degree at least
The circumference of a graph with a given minimal degree
On graphs not containing prescribed induced subgraphs
A compact sequential space
Locally finite groups of permutations of M acting on
On the number of certain subgraphs of graphs without large
On a centered posets
On the ErdosFuchs theorems
Special Lucas sequences including the Fibonacci sequence
Graphs with no unfriendly partitions
Sperner Turan and Bregman revisited
Sur une question dErdos et Schinzel
Large apreserving sets in infinite aconnected graphs
Partitioning the quadruples of topological spaces
Sets of multiples of Behrend sequences
The differences between consecutive primes IV
Other editions - View all
a-connected Abelian group apply 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 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 Lemma lemme Let G limit ordinal log log 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 ultrafilter uncountable uniformly upper bound vertex set vertices