+612 9045 4394
Combinatorics, Geometry and Probability : A Tribute to Paul Erdoes - Bela Bollobas

Combinatorics, Geometry and Probability

A Tribute to Paul Erdoes

By: Bela Bollobas (Editor), Andrew Thomason (Editor)


Published: 19th August 2004
RRP $79.95
This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

Other Available Formats (Hide)

Paul Erdoes 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. Erdoes 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 panorama across the breadth of combinatorics as it is today.

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
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521607667
ISBN-10: 0521607663
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 588
Published: 19th August 2004
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 24.7 x 17.4  x 3.0
Weight (kg): 1.04