Combinatorics, geometry, and probability: a tribute to Paul Erdős
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...
Gespeichert in:
| Weitere Verfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1997
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
| Zusammenfassung: | 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 in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xxi, 562 pages) |
| ISBN: | 9780511662034 |
| DOI: | 10.1017/CBO9780511662034 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043944958 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1997 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511662034 |c Online |9 978-0-511-66203-4 | ||
| 024 | 7 | |a 10.1017/CBO9780511662034 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511662034 | ||
| 035 | |a (OCoLC)849899620 | ||
| 035 | |a (DE-599)BVBBV043944958 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511/.6 |2 20 | |
| 084 | |a SD 1993 |0 (DE-625)142727: |2 rvk | ||
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 245 | 1 | 0 | |a Combinatorics, geometry, and probability |b a tribute to Paul Erdős |c edited by Béla Bollobás, Andrew Thomason |
| 246 | 1 | 3 | |a Combinatorics, Geometry & Probability |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1997 | |
| 300 | |a 1 online resource (xxi, 562 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | 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 H-factors |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 distance-regular 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 in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today | ||
| 650 | 4 | |a Combinatorial analysis / Congresses | |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Erdős, Paul |d 1913-1996 |4 edt | |
| 700 | 1 | |a Bollobás, Béla |4 edt | |
| 700 | 1 | |a Thomason, Andrew |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-58472-2 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-60766-7 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511662034 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029353927 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511662034 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511662034 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176890562347008 |
|---|---|
| any_adam_object | |
| author2 | Erdős, Paul 1913-1996 Bollobás, Béla Thomason, Andrew |
| author2_role | edt edt edt |
| author2_variant | p e pe b b bb a t at |
| author_additional | R. Aharoni and R. Diestel R. Ahlswede and N. Cai M. Aigner and R. Klimmek M. Aigner and E. Triesch N. Alon and R. Yuster A.D. Barbour and S. Tavaré J. Beck S.L. Bezrukov N.L. Biggs |
| author_facet | Erdős, Paul 1913-1996 Bollobás, Béla Thomason, Andrew |
| building | Verbundindex |
| bvnumber | BV043944958 |
| classification_rvk | SD 1993 SK 170 |
| collection | ZDB-20-CBO |
| contents | Menger's Theorem for a countable source set On extremal set partitions in Cartesian Product Spaces Matchings in lattice graphs and Hamming graphs Reconstructing a graph from its neighborhood lists Threshold functions for H-factors A rate for the Erdos Turan Law Deterministic graph games and a probabilistic intuition On oriented embedding of the binary tree into the hypercube Potential theory on distance-regular graphs |
| ctrlnum | (ZDB-20-CBO)CR9780511662034 (OCoLC)849899620 (DE-599)BVBBV043944958 |
| dewey-full | 511/.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.6 |
| dewey-search | 511/.6 |
| dewey-sort | 3511 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511662034 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03484nmm a2200529zc 4500</leader><controlfield tag="001">BV043944958</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511662034</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-66203-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511662034</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511662034</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)849899620</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043944958</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SD 1993</subfield><subfield code="0">(DE-625)142727:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorics, geometry, and probability</subfield><subfield code="b">a tribute to Paul Erdős</subfield><subfield code="c">edited by Béla Bollobás, Andrew Thomason</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Combinatorics, Geometry & Probability</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxi, 562 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="t">Menger's Theorem for a countable source set</subfield><subfield code="r">R. Aharoni and R. Diestel</subfield><subfield code="t">On extremal set partitions in Cartesian Product Spaces</subfield><subfield code="r">R. Ahlswede and N. Cai</subfield><subfield code="t">Matchings in lattice graphs and Hamming graphs</subfield><subfield code="r">M. Aigner and R. Klimmek</subfield><subfield code="t">Reconstructing a graph from its neighborhood lists</subfield><subfield code="r">M. Aigner and E. Triesch</subfield><subfield code="t">Threshold functions for H-factors</subfield><subfield code="r">N. Alon and R. Yuster</subfield><subfield code="t">A rate for the Erdos Turan Law</subfield><subfield code="r">A.D. Barbour and S. Tavaré</subfield><subfield code="t">Deterministic graph games and a probabilistic intuition</subfield><subfield code="r">J. Beck</subfield><subfield code="t">On oriented embedding of the binary tree into the hypercube</subfield><subfield code="r">S.L. Bezrukov</subfield><subfield code="t">Potential theory on distance-regular graphs</subfield><subfield code="r">N.L. Biggs</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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 in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis / Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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="700" ind1="1" ind2=" "><subfield code="a">Erdős, Paul</subfield><subfield code="d">1913-1996</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bollobás, Béla</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thomason, Andrew</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-58472-2</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-60766-7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511662034</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029353927</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><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511662034</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511662034</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV043944958 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:22Z |
| institution | BVB |
| isbn | 9780511662034 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029353927 |
| oclc_num | 849899620 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xxi, 562 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Combinatorics, geometry, and probability a tribute to Paul Erdős edited by Béla Bollobás, Andrew Thomason Combinatorics, Geometry & Probability Cambridge Cambridge University Press 1997 1 online resource (xxi, 562 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Menger's Theorem for a countable source set R. Aharoni and R. Diestel On extremal set partitions in Cartesian Product Spaces R. Ahlswede and N. Cai Matchings in lattice graphs and Hamming graphs M. Aigner and R. Klimmek Reconstructing a graph from its neighborhood lists M. Aigner and E. Triesch Threshold functions for H-factors N. Alon and R. Yuster A rate for the Erdos Turan Law A.D. Barbour and S. Tavaré Deterministic graph games and a probabilistic intuition J. Beck On oriented embedding of the binary tree into the hypercube S.L. Bezrukov Potential theory on distance-regular graphs N.L. Biggs 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 in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today Combinatorial analysis / Congresses Kombinatorik (DE-588)4031824-2 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Kombinatorik (DE-588)4031824-2 s 1\p DE-604 Erdős, Paul 1913-1996 edt Bollobás, Béla edt Thomason, Andrew edt Erscheint auch als Druckausgabe 978-0-521-58472-2 Erscheint auch als Druckausgabe 978-0-521-60766-7 https://doi.org/10.1017/CBO9780511662034 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Combinatorics, geometry, and probability a tribute to Paul Erdős Menger's Theorem for a countable source set On extremal set partitions in Cartesian Product Spaces Matchings in lattice graphs and Hamming graphs Reconstructing a graph from its neighborhood lists Threshold functions for H-factors A rate for the Erdos Turan Law Deterministic graph games and a probabilistic intuition On oriented embedding of the binary tree into the hypercube Potential theory on distance-regular graphs Combinatorial analysis / Congresses Kombinatorik (DE-588)4031824-2 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)1071861417 |
| title | Combinatorics, geometry, and probability a tribute to Paul Erdős |
| title_alt | Combinatorics, Geometry & Probability Menger's Theorem for a countable source set On extremal set partitions in Cartesian Product Spaces Matchings in lattice graphs and Hamming graphs Reconstructing a graph from its neighborhood lists Threshold functions for H-factors A rate for the Erdos Turan Law Deterministic graph games and a probabilistic intuition On oriented embedding of the binary tree into the hypercube Potential theory on distance-regular graphs |
| title_auth | Combinatorics, geometry, and probability a tribute to Paul Erdős |
| title_exact_search | Combinatorics, geometry, and probability a tribute to Paul Erdős |
| title_full | Combinatorics, geometry, and probability a tribute to Paul Erdős edited by Béla Bollobás, Andrew Thomason |
| title_fullStr | Combinatorics, geometry, and probability a tribute to Paul Erdős edited by Béla Bollobás, Andrew Thomason |
| title_full_unstemmed | Combinatorics, geometry, and probability a tribute to Paul Erdős edited by Béla Bollobás, Andrew Thomason |
| title_short | Combinatorics, geometry, and probability |
| title_sort | combinatorics geometry and probability a tribute to paul erdos |
| title_sub | a tribute to Paul Erdős |
| topic | Combinatorial analysis / Congresses Kombinatorik (DE-588)4031824-2 gnd |
| topic_facet | Combinatorial analysis / Congresses Kombinatorik Konferenzschrift |
| url | https://doi.org/10.1017/CBO9780511662034 |
| work_keys_str_mv | AT erdospaul combinatoricsgeometryandprobabilityatributetopaulerdos AT bollobasbela combinatoricsgeometryandprobabilityatributetopaulerdos AT thomasonandrew combinatoricsgeometryandprobabilityatributetopaulerdos AT erdospaul combinatoricsgeometryprobability AT bollobasbela combinatoricsgeometryprobability AT thomasonandrew combinatoricsgeometryprobability |