Combinatorics, geometry, and probability :
Combinatorics, geometry, and probability : a tribute to Paul Erdős /
Combinatorics, Geometry & Probability
edited by Béla Bollobás, Andrew Thomason.
- Cambridge : Cambridge University Press, 1997.
- 1 online resource (xxi, 562 pages) : digital, PDF file(s).
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Menger's Theorem for a countable source set / On extremal set partitions in Cartesian Product Spaces / Matchings in lattice graphs and Hamming graphs / Reconstructing a graph from its neighborhood lists / Threshold functions for H-factors / A rate for the Erdos Turan Law / Deterministic graph games and a probabilistic intuition / On oriented embedding of the binary tree into the hypercube / Potential theory on distance-regular graphs / R. Aharoni and R. Diestel -- R. Ahlswede and N. Cai -- M. Aigner and R. Klimmek -- M. Aigner and E. Triesch -- N. Alon and R. Yuster -- A.D. Barbour and S. Tavaré -- J. Beck -- S.L. Bezrukov -- N.L. Biggs.
Paul Erdös 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. Erdös 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.
9780511662034 (ebook)
Combinatorial analysis--Congresses.
QA164 / .C66357 1997
511/.6
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Menger's Theorem for a countable source set / On extremal set partitions in Cartesian Product Spaces / Matchings in lattice graphs and Hamming graphs / Reconstructing a graph from its neighborhood lists / Threshold functions for H-factors / A rate for the Erdos Turan Law / Deterministic graph games and a probabilistic intuition / On oriented embedding of the binary tree into the hypercube / Potential theory on distance-regular graphs / R. Aharoni and R. Diestel -- R. Ahlswede and N. Cai -- M. Aigner and R. Klimmek -- M. Aigner and E. Triesch -- N. Alon and R. Yuster -- A.D. Barbour and S. Tavaré -- J. Beck -- S.L. Bezrukov -- N.L. Biggs.
Paul Erdös 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. Erdös 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.
9780511662034 (ebook)
Combinatorial analysis--Congresses.
QA164 / .C66357 1997
511/.6