02601nam a22003378i 4500001001600000003000700016008004100023020001800064020001800082020001800100035002000118041000800138082001500146245013000161264007100291300003900362336002600401337002600427338003600453500001300489505066800502520076901170650004001939700002601979700003002005700003002035856005502065932003202120596000602152949010502158CR9780511662034UkCbUP091215s1997||||enk o ||1 0|eng|d a9780511662034 a9780521584722 a9780521607667 a(Sirsi) a793076 aeng00a511/.622000aCombinatorics, geometry, and probability :ba tribute to Paul Erdősh[E-Book] /cedited by Béla Bollobás, Andrew Thomason. 1aCambridge :bCambridge University Press,c1997e(CUP)fCUP20200108 a1 online resource (xxi, 562 pages) atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier aenglisch00tMenger'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. 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. 0aCombinatorial analysisvCongresses.1 aErdős, Paul,eeditor1 aBollobás, Béla,eeditor1 aThomason, Andrew,eeditor40uhttps://doi.org/10.1017/CBO9780511662034zVolltext aCambridgeCore (Order 30059) a1 aXX(793076.1)wAUTOc1i793076-1001lELECTRONICmZBrNsYtE-BOOKu8/1/2020xUNKNOWNzUNKNOWN1ONLINE