MARC Record from marc_columbia

LEADER: 05063mam a2200361 a 4500
001 2004196
005 20220609050155.0
008 960919s1997 enka b 110 0 eng
010 $a 96046075
020 $a0521584728 (hardback)
035 $a(OCoLC)ocm35638207
035 $9AMM8486CU
035 $a(NNC)2004196
035 $a2004196
040 $aDLC$cDLC$dC#P$dOrLoB-B
050 00 $aQA164$b.C66357 1997
082 00 $a511/.6$220
245 00 $aCombinatorics, geometry, and probability :$ba tribute to Paul Erdʺos /$cedited by Béla Bollobás, Andrew Thomason.
260 $aCambridge ;$aNew York :$bCambridge University Press,$c1997.
300 $axxi, 562 pages :$billustrations ;$c26 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
500 $aPapers from a conference held at Trinity College, Cambridge, Mar. 26, 1993.
504 $aIncludes bibliographical references.
505 00 $tFarewell to Paul Erdos --$tToast to Paul Erdos --$tPaul Erdos: Some Unsolved Problems --$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. Tavare --$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 --$tOn the Length of the Longest Increasing Subsequence in a Random Permutation /$rB. Bollobas and S. Janson --$tOn Richardson's Model on the Hypercube /$rB. Bollobas and Y. Kohayakawa --
505 80 $tRandom Permutations: Some Group-Theoretic Aspects /$rP. J. Cameron and W. M. Kantor --$tRamsey Problems with Bounded Degree Spread /$rG. Chen and R. H. Schelp --$tHamilton Cycles in Random Regular Digraphs /$rC. Cooper, A. Frieze and M. Molloy --$tOn Triangle Contact Graphs /$rH. de Fraysseix, P. Ossona de Mendez and P. Rosenstiehl --$tA Combinatorial Approach to Complexity Theory via Ordinal Hierarchies /$rW. A. Deuber and W. Thumser --$tLattice Points of Cut Cones /$rM. Deza and V. Grishukhin --$tThe Growth of Infinite Graphs: Boundedness and Finite Spreading /$rR. Diestel and I. Leader --$tAmalgamated Factorizations of Complete Graphs /$rJ. K. Dugdale and A. J. W. Hilton --$tRamsey Size Linear Graphs /$rPaul Erdos, R. J. Faudree and C. C. Rousseau [et al.] --$tTuran Ramsey Theorems and K[subscript p]-Independence Numbers /$rPaul Erdos, A. Hajnal and M. Simonovits [et al.] --$tNearly Equal Distances in the Plane /$rPaul Erdos, E. Makai and J. Pach --
505 80 $tClique Partitions of Chordal Graphs /$rPaul Erdos, E. T. Ordman and Y. Zalestein --$tOn Intersecting Chains in Boolean Algebras /$rPeter L. Erdos, A. Seress and L. A. Szekely --$tOn the Maximum Number of Triangles in Wheel-Free Graphs /$rZ. Furedi, M. X. Goemans and D. J. Kleitman --$tBlocking Sets in SQS (2v) /$rM. Gionfriddo, S. Milici and Zs. Tuza --$t(1,2)-Factorizations of General Fulerian Nearly Regular Graphs /$rR. Haggkvist and A. Johansson --$tOriented Hamilton Cycles in Oriented Graphs /$rR. Haggkvist and A. Thomason --$tMinimization Problems for Infinite n-Connected Graphs /$rR. Halin --$tOn Universal Threshold Graphs /$rP. L. Hammer and A. K. Kelmans --$tImage Partition Regularity of Matrices /$rN. Hindman and I. Leader --$tExtremal Graph Problems for Graphs with a Color-Critical Vertex /$rC. Hundack, H. J. Promel and A. Steger --$tA Note on [omega] [subscript 1] [actual symbol not reproducible] [omega] [subscript 1] Functions /$rP. Komjath --
505 80 $tTopological Cliques in Graphs /$rJ. Komlos and E. Szemeredi --$tLocal-Global Phenomena in Graphs /$rN. Linial --$tOn Random Generation of the Symmetric Group /$rT. Luczak and L. Pyber --$tOn Vertex-Edge-Critically n-Connected Graphs /$rW. Mader --$tOn a Conjecture of Erdos and Cudakov /$rA. R. D. Mathias --$tA Random Recolouring Method for Graphs and Hypergraphs /$rC. McDiarmid --$tObstructions for the Disk and the Cylinder Embedding Extension Problems /$rB. Mohar --$tA Ramsey-Type Theorem in the Plane /$rJ. Nesetril and P. Valtr --$tThe Enumeration of Self-Avoiding Walks and Domains on a Lattice /$rH. N. V. Temperley --$tAn Extension of Foster's Network Theorem /$rP. Tetali --$tRandomised Approximation in the Tutte Plane /$rD. J. A. Welsh --$tOn Crossing Numbers, and some Unsolved Problems /$rH. S. Wilf.
650 0 $aCombinatorial analysis$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2008101218
700 1 $aErdős, Paul,$d1913-1996.$0http://id.loc.gov/authorities/names/n50010022
700 1 $aBollobás, Béla.$0http://id.loc.gov/authorities/names/n78062675
700 1 $aThomason, Andrew.$0http://id.loc.gov/authorities/names/n96091704
852 00 $bmat$hQA164$i.C66357 1997