Combinatorics, geometry, and probability : a tribute to Paul Erdős [EBook] / edited by Béla Bollobás, Andrew Thomason.
Combinatorics, geometry, and probability : a tribute to Paul Erdős [EBook] / edited by Béla Bollobás, Andrew Thomason.
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 con...
Personal Name(s):  Erdős, Paul, (editor) 

Bollobás, Béla, (editor) / Thomason, Andrew, (editor)  
Imprint: 
Cambridge :
Cambridge University Press,
1997

Physical Description: 
1 online resource (xxi, 562 pages) 
Note: 
englisch 
ISBN: 
9780511662034 9780521607667 9780521584722 
Subject (LOC):  
Full Text 
LEADER  02601nam a22003378i 4500  

001  CR9780511662034  
003  UkCbUP  
008  091215s1997enk o 1 0engd  
020  a 9780511662034  
020  a 9780521584722  
020  a 9780521607667  
035  a (Sirsi) a793076  
041  a eng  
082  0  0  a 511/.6 2 20 
245  0  0  a Combinatorics, geometry, and probability : b a tribute to Paul Erdős h [EBook] / c edited by Béla Bollobás, Andrew Thomason. 
264  1  a Cambridge : b Cambridge University Press, c 1997 e (CUP) f CUP20200108  
300  a 1 online resource (xxi, 562 pages)  
336  a text b txt 2 rdacontent  
337  a computer b c 2 rdamedia  
338  a online resource b cr 2 rdacarrier  
500  a englisch  
505  0  0  t Menger's Theorem for a countable source set / r R. Aharoni and R. Diestel  t On extremal set partitions in Cartesian Product Spaces / r R. Ahlswede and N. Cai  t Matchings in lattice graphs and Hamming graphs / r M. Aigner and R. Klimmek  t Reconstructing a graph from its neighborhood lists / r M. Aigner and E. Triesch  t Threshold functions for Hfactors / r N. Alon and R. Yuster  t A rate for the Erdos Turan Law / r A.D. Barbour and S. Tavaré  t Deterministic graph games and a probabilistic intuition / r J. Beck  t On oriented embedding of the binary tree into the hypercube / r S.L. Bezrukov  t Potential theory on distanceregular graphs / r N.L. Biggs. 
520  a 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 indepth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.  
650  0  a Combinatorial analysis v Congresses.  
700  1  a Erdős, Paul, e editor  
700  1  a Bollobás, Béla, e editor  
700  1  a Thomason, Andrew, e editor  
856  4  0  u https://doi.org/10.1017/CBO9780511662034 z Volltext 
932  a CambridgeCore (Order 30059)  
596  a 1  
949  a XX(793076.1) w AUTO c 1 i 7930761001 l ELECTRONIC m ZB r N s Y t EBOOK u 8/1/2020 x UNKNOWN z UNKNOWN 1 ONLINE 