Combinatorics, geometry, and probability : a tribute to Paul Erdős [E-Book] / edited by Béla Bollobás, Andrew Thomason.
Erdős, Paul, (editor)
Bollobás, Béla, (editor) / Thomason, Andrew, (editor)
Cambridge : Cambridge University Press, 1997
1 online resource (xxi, 562 pages)
englisch
9780511662034
9780521607667
9780521584722
Full Text
Table of Contents:
  • Menger's Theorem for a countable source set /
  • R. Aharoni and R. Diestel
  • On extremal set partitions in Cartesian Product Spaces /
  • R. Ahlswede and N. Cai
  • Matchings in lattice graphs and Hamming graphs /
  • M. Aigner and R. Klimmek
  • Reconstructing a graph from its neighborhood lists /
  • M. Aigner and E. Triesch
  • Threshold functions for H-factors /
  • N. Alon and R. Yuster
  • A rate for the Erdos Turan Law /
  • A.D. Barbour and S. Tavaré
  • Deterministic graph games and a probabilistic intuition /
  • J. Beck
  • On oriented embedding of the binary tree into the hypercube /
  • S.L. Bezrukov
  • Potential theory on distance-regular graphs /
  • N.L. Biggs.