000 03509cam a2200601Ia 4500
001 ocn316566719
003 OCoLC
005 20141103172225.0
006 m o d
007 cr cn|||||||||
008 090320s1987 ne a ob 100 0 eng d
040 _aOPELS
_beng
_cOPELS
_dOPELS
_dOCLCQ
_dOCLCF
_dDEBBG
020 _a9780444702654
020 _a0444702652
029 1 _aNZ1
_b15193168
029 1 _aDEBBG
_bBV036962625
029 1 _aDEBSZ
_b407392459
035 _a(OCoLC)316566719
037 _a127776:122960
_bElsevier Science & Technology
_nhttp://www.sciencedirect.com
050 4 _aQA166.17
_b.I58 1985eb
082 0 4 _a511/.6
_222
049 _aTEFA
111 2 _aInternational Seminar on Random Graphs and Probabilistic Methods in Combinatorics
_n(2nd :
_d1985 :
_cPozna�n, Poland)
245 1 0 _aRandom graphs '85
_h[electronic resource] :
_bbased on lectures presented at the 2nd International Seminar on Random Graphs and Probabilistic Methods in Combinatorics, August 5-9, 1985 /
_corganized and sponsored by the Institute of Mathematics, Adam Mickiewicz University, Pozna�n, Poland ; edited by Micha� Karo�nski and Zbigniew Palka.
260 _aAmsterdam ;
_aNew York :
_bNorth-Holland ;
_aNew York, N.Y., U.S.A. :
_bSole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
_cc1987.
300 _a1 online resource (vii, 354 p.) :
_bill.
490 1 _aNorth-Holland mathematics studies ;
_v144
490 1 _aAnnals of discrete mathematics ;
_v33
520 _aCovering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures. Papers in this collection also illustrate various aspects of percolation theory and its applications, properties of random lattices and random walks on such graphs, random allocation schemes, pseudo-random graphs and reliability of planar networks. Several open problems that were presented during a special session at the Seminar are also included at the end of the volume.
504 _aIncludes bibliographical references.
588 _aDescription based on print version record.
650 0 _aRandom graphs
_vCongresses.
650 0 _aProbabilities
_vCongresses.
650 0 _aCombinatorial analysis
_vCongresses.
650 6 _aGraphes al�eatoires
_vCongr�es.
650 6 _aProbabilit�es combinatoires
_vCongr�es.
650 6 _aArbres (Th�eorie des graphes)
_xCongr�es.
650 7 _aCombinatorial analysis.
_2fast
_0(OCoLC)fst00868961
650 7 _aProbabilities.
_2fast
_0(OCoLC)fst01077737
650 7 _aRandom graphs.
_2fast
_0(OCoLC)fst01089802
655 4 _aElectronic books.
655 7 _aConference proceedings.
_2fast
_0(OCoLC)fst01423772
700 1 _aKaro�nski, Micha�.
_4edt
700 1 _aPalka, Zbigniew.
_4edt
710 2 _aUniwersytet im. Adama Mickiewicza w Poznaniu.
_bInstytut Matematyki.
776 0 8 _iPrint version:
_z0444702652
_z9780444702654
_w(DLC) 88179767
_w(OCoLC)22763808
830 0 _aNorth-Holland mathematics studies ;
_v144.
830 0 _aAnnals of discrete mathematics ;
_v33.
856 4 0 _3ScienceDirect
_uhttp://www.sciencedirect.com/science/book/9780444702654
856 4 _uhttp://www.sciencedirect.com/science/publication?issn=03040208&volume=144
_3Volltext
942 _cEB
994 _aC0
_bTEF
999 _c21800
_d21800