Skip to content

Combinatorics, Geometry and Probability A Tribute to Paul Erd�s

Best in textbook rentals since 2012!

ISBN-10: 0521607663

ISBN-13: 9780521607667

Edition: N/A

Authors: B�la Bollob�s, Andrew G. Thomason

List price: $62.99
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


Paul Erds was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erds himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable…    
Customers also bought

Book details

List price: $62.99
Publisher: Cambridge University Press
Publication date: 8/19/2004
Binding: Paperback
Pages: 588
Size: 7.48" wide x 9.69" long x 1.18" tall
Weight: 2.332
Language: English

Some unsolved problems
Menger's theorem for a countable source set
On extremal set partitions in Cartesian product spaces
Matchings in lattice graphs
Reconstructing a graph from its neighbourhood lists
Threshold functions for H-factors
A rate for the Erdös-Tur��n law
Deterministic graph games
On oriented embedding of the binary tree into the hypercube
Potential theory on distance-regular graphs
On the length of the longest increasing subsequence in a random permutation
On Richardson���s model on the hypercube
Random permutations: some group-theoretic aspects
Ramsey problems with bounded degree spread
Hamilton cycles in random regular digraphs
On triangle contact graphs H. de Fraysseix
A combinatorial approach to complexity theory via ordinal hierarchies
Lattice points of cut cones
The growth of infinite graphs: boundedness
Amalgamated factorizations of complete graphs
Ramsey size linear graphs Paul Erdös
Tur��n-Ramsey theorems
Nearly equal distances in the plane
Clique partitions of chordal graphs
On intersecting chains in Boolean algebras
On the maximum number of triangles in wheel-free graphs
Blocking sets in SQS(2v)
(1,2)-factorisations of general Eulerian nearly regular graphs
Oriented Hamilton cycles in digraphs
Minimization problems for infinite n-connected graphs
On universal threshold graphs
Image partition regularity of matrices
Extremal graph problems for graphs with a color-critical vertex
A note on W1-to-W1 functions
Topological cliques in graphs
Local-global phenomena in graphs
On random generation of the symmetric group
On vertex-edge-critically n-connected graphs
On a conjecture of Erdös
A random recolouring method for graphs and hypergraphs
Obstructions for the disk
A Ramsey-type theorem in the plane
The enumeration of self-avoiding walks domains on a lattice
An extension of Foster's network theorem
Randomised approximation in the Tutte plane
On crossing numbers, and some unsolved problems