| 000 | 02759nam a22003738i 4500 | ||
|---|---|---|---|
| 001 | CR9780511662034 | ||
| 003 | UkCbUP | ||
| 005 | 20200124160318.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 091215s1997||||enk o ||1 0|eng|d | ||
| 020 | _a9780511662034 (ebook) | ||
| 020 | _z9780521584722 (hardback) | ||
| 020 | _z9780521607667 (paperback) | ||
| 040 |
_aUkCbUP _beng _erda _cUkCbUP |
||
| 050 | 0 | 0 |
_aQA164 _b.C66357 1997 |
| 082 | 0 | 0 |
_a511/.6 _220 |
| 245 | 0 | 0 |
_aCombinatorics, geometry, and probability : _ba tribute to Paul Erdős / _cedited by Béla Bollobás, Andrew Thomason. |
| 246 | 3 | _aCombinatorics, Geometry & Probability | |
| 264 | 1 |
_aCambridge : _bCambridge University Press, _c1997. |
|
| 300 |
_a1 online resource (xxi, 562 pages) : _bdigital, PDF file(s). |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 500 | _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). | ||
| 505 | 0 | 0 |
_tMenger's Theorem for a countable source set / _rR. Aharoni and R. Diestel -- _tOn extremal set partitions in Cartesian Product Spaces / _rR. Ahlswede and N. Cai -- _tMatchings in lattice graphs and Hamming graphs / _rM. Aigner and R. Klimmek -- _tReconstructing a graph from its neighborhood lists / _rM. Aigner and E. Triesch -- _tThreshold functions for H-factors / _rN. Alon and R. Yuster -- _tA rate for the Erdos Turan Law / _rA.D. Barbour and S. Tavaré -- _tDeterministic graph games and a probabilistic intuition / _rJ. Beck -- _tOn oriented embedding of the binary tree into the hypercube / _rS.L. Bezrukov -- _tPotential theory on distance-regular graphs / _rN.L. Biggs. |
| 520 | _aPaul 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. | ||
| 650 | 0 |
_aCombinatorial analysis _vCongresses. |
|
| 700 | 1 |
_aErdős, Paul, _d1913-1996, _eeditor. |
|
| 700 | 1 |
_aBollobás, Béla, _eeditor. |
|
| 700 | 1 |
_aThomason, Andrew, _eeditor. |
|
| 776 | 0 | 8 |
_iPrint version: _z9780521584722 |
| 856 | 4 | 0 | _uhttps://doi.org/10.1017/CBO9780511662034 |
| 999 |
_c521649 _d521647 |
||