## Combinatorics, Geometry and Probability: A Tribute to Paul ErdösPaul Erdős, B La Bollob?'s, Andrew Thomason The areas represented in this collection range from set theory and geometry through graph theory, group theory and combinatorial probability, to randomized algorithms and statistical physics. Erdös himself was able to give a survey of recent progress made on his favorite problems. Consequently this volume, comprised of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today. |

### What people are saying - Write a review

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

### Contents

Some Unsolved Problems | 1 |

Ahlswede R and N | 23 |

and E Triesch | 51 |

Barbour A D and S Tavare | 71 |

Bezrukov S L | 95 |

Bollobas B and S Janson | 121 |

Cameron P J and W M Kantor | 139 |

A Frieze and M Molloy | 153 |

Erdos Peter L A Seress and L A Szekely | 299 |

S Milici and Zs Tuza | 319 |

Haggkvist R and A Thomason | 339 |

Halin | 355 |

Hammer P L and A K Kelmans | 375 |

Hindman N and I Leader | 393 |

A Note on io w Functions | 435 |

LocalGlobal Phenomena in Graphs | 449 |

Deuber W A and W Thumser | 179 |

and V Grishukhin | 193 |

Diestel R and I Leader | 217 |

Erdos Paul R J Faudree C C Rousseau and R H Schelp | 241 |

Erdos Paul E Makai and J Pach | 283 |

On Random Generation of the Symmetric Group | 463 |

A RamseyType Theorem in the Plane | 525 |

An Extension of Fosters Network Theorem | 541 |

Randomised Approximation in the Tutte Plane | 549 |

### Other editions - View all

Combinatorics, Geometry and Probability: A Tribute to Paul Erdös Béla Bollobás,Andrew Thomason No preview available - 2004 |

### Common terms and phrases

2-minimally 3-connected components adjacent algorithm assume attached bipartite graph blocking set Bollobas chordal graph clique Combinatorial complete graph condition conjecture connected graph consider construction contains contradiction Corollary corresponding cycle defined deleting denote the set digraph disjoint crossing paths edge coloured embedding extension problem Erdos exists extension problem extremal graph factorization finite function given graph G Graph Theory Hamilton cycles Hence holds hypergraph image partition regular implies induced subgraph inequality infinite integer intersection isomorphic joining least Lemma Let G matching matrix maximal millipede minimal n-minimizable number of edges number of vertices obstruction obtained oriented pair partition regular Paul Erdos permutation planar plane graph points positive integer proof of Theorem Proposition prove Ramsey size linear Ramsey Theory random graphs respectively result satisfies Section subcubes subgraph of G subset sufficiently large Suppose Theorem 2.2 threshold graphs universal graphs upper bound vertex set