Random graphs:
"This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up to date and comprehensive account of rand...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge Univ. Press
2001
|
| Ausgabe: | 2. ed. |
| Schriftenreihe: | Cambridge studies in advances mathematics
73 |
| Schlagworte: | |
| Zusammenfassung: | "This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up to date and comprehensive account of random graph theory. The theory (founded by Erdös and Re;nyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study." -- Book cover. |
| Beschreibung: | XVIII, 498 S. graph. Darst. |
| ISBN: | 0521797225 0521809207 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV019636426 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 041216s2001 d||| |||| 00||| eng d | ||
| 020 | |a 0521797225 |9 0-521-79722-5 | ||
| 020 | |a 0521809207 |9 0-521-80920-7 | ||
| 035 | |a (OCoLC)45583496 | ||
| 035 | |a (DE-599)BVBBV019636426 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA166.17 | |
| 082 | 0 | |a 511/.5 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a 60B99 |2 msc | ||
| 084 | |a 05C80 |2 msc | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a MAT 602f |2 stub | ||
| 100 | 1 | |a Bollobás, Béla |d 1943- |e Verfasser |0 (DE-588)109481240 |4 aut | |
| 245 | 1 | 0 | |a Random graphs |c Béla Bollobás |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Cambridge |b Cambridge Univ. Press |c 2001 | |
| 300 | |a XVIII, 498 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cambridge studies in advances mathematics |v 73 | |
| 520 | 3 | |a "This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up to date and comprehensive account of random graph theory. The theory (founded by Erdös and Re;nyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study." -- Book cover. | |
| 650 | 7 | |a Grafentheorie |2 gtt | |
| 650 | 4 | |a Graphes aléatoires | |
| 650 | 7 | |a Zufallsgraph |2 swd | |
| 650 | 4 | |a Random graphs | |
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zufallsgraph |0 (DE-588)4277661-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Zufallsgraph |0 (DE-588)4277661-2 |D s |
| 689 | 0 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 830 | 0 | |a Cambridge studies in advances mathematics |v 73 |w (DE-604)BV000003678 |9 73 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-012965401 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804133006585102336 |
|---|---|
| any_adam_object | |
| author | Bollobás, Béla 1943- |
| author_GND | (DE-588)109481240 |
| author_facet | Bollobás, Béla 1943- |
| author_role | aut |
| author_sort | Bollobás, Béla 1943- |
| author_variant | b b bb |
| building | Verbundindex |
| bvnumber | BV019636426 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.17 |
| callnumber-search | QA166.17 |
| callnumber-sort | QA 3166.17 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | MAT 055f MAT 602f |
| ctrlnum | (OCoLC)45583496 (DE-599)BVBBV019636426 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02592nam a2200517 cb4500</leader><controlfield tag="001">BV019636426</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">041216s2001 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521797225</subfield><subfield code="9">0-521-79722-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521809207</subfield><subfield code="9">0-521-80920-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)45583496</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019636426</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.17</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">60B99</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05C80</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 602f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bollobás, Béla</subfield><subfield code="d">1943-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109481240</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Random graphs</subfield><subfield code="c">Béla Bollobás</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 498 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge studies in advances mathematics</subfield><subfield code="v">73</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up to date and comprehensive account of random graph theory. The theory (founded by Erdös and Re;nyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study." -- Book cover.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes aléatoires</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Zufallsgraph</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random graphs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufallsgraph</subfield><subfield code="0">(DE-588)4277661-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Zufallsgraph</subfield><subfield code="0">(DE-588)4277661-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge studies in advances mathematics</subfield><subfield code="v">73</subfield><subfield code="w">(DE-604)BV000003678</subfield><subfield code="9">73</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012965401</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV019636426 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:01:51Z |
| institution | BVB |
| isbn | 0521797225 0521809207 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012965401 |
| oclc_num | 45583496 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-83 DE-11 |
| owner_facet | DE-19 DE-BY-UBM DE-83 DE-11 |
| physical | XVIII, 498 S. graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| series | Cambridge studies in advances mathematics |
| series2 | Cambridge studies in advances mathematics |
| spelling | Bollobás, Béla 1943- Verfasser (DE-588)109481240 aut Random graphs Béla Bollobás 2. ed. Cambridge Cambridge Univ. Press 2001 XVIII, 498 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Cambridge studies in advances mathematics 73 "This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up to date and comprehensive account of random graph theory. The theory (founded by Erdös and Re;nyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study." -- Book cover. Grafentheorie gtt Graphes aléatoires Zufallsgraph swd Random graphs Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Zufallsgraph (DE-588)4277661-2 gnd rswk-swf Zufallsgraph (DE-588)4277661-2 s Mathematische Logik (DE-588)4037951-6 s 1\p DE-604 Cambridge studies in advances mathematics 73 (DE-604)BV000003678 73 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Bollobás, Béla 1943- Random graphs Cambridge studies in advances mathematics Grafentheorie gtt Graphes aléatoires Zufallsgraph swd Random graphs Mathematische Logik (DE-588)4037951-6 gnd Zufallsgraph (DE-588)4277661-2 gnd |
| subject_GND | (DE-588)4037951-6 (DE-588)4277661-2 |
| title | Random graphs |
| title_auth | Random graphs |
| title_exact_search | Random graphs |
| title_full | Random graphs Béla Bollobás |
| title_fullStr | Random graphs Béla Bollobás |
| title_full_unstemmed | Random graphs Béla Bollobás |
| title_short | Random graphs |
| title_sort | random graphs |
| topic | Grafentheorie gtt Graphes aléatoires Zufallsgraph swd Random graphs Mathematische Logik (DE-588)4037951-6 gnd Zufallsgraph (DE-588)4277661-2 gnd |
| topic_facet | Grafentheorie Graphes aléatoires Zufallsgraph Random graphs Mathematische Logik |
| volume_link | (DE-604)BV000003678 |
| work_keys_str_mv | AT bollobasbela randomgraphs |