Surveys in combinatorics 2007:
This 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2007
|
| Schriftenreihe: | London Mathematical Society lecture note series
346 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | This 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (vii, 286 pages) |
| ISBN: | 9780511666209 |
| DOI: | 10.1017/CBO9780511666209 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043946037 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2007 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511666209 |c Online |9 978-0-511-66620-9 | ||
| 024 | 7 | |a 10.1017/CBO9780511666209 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511666209 | ||
| 035 | |a (OCoLC)847017774 | ||
| 035 | |a (DE-599)BVBBV043946037 | ||
| 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 22 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 110 | 2 | |a British Combinatorial Conference < 2007, Reading, England> |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Surveys in combinatorics 2007 |c edited by Anthony Hilton, John Talbot |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2007 | |
| 300 | |a 1 online resource (vii, 286 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a London Mathematical Society lecture note series |v 346 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Hereditary and monotone propertie of combinatorial structures / Béla Bollobás -- Ordering classes of matrices of 0s and 1s / Richard A. Brualdi -- Cycle decompositions of complete graphs / Darryn Bryant -- Excluding induced subgraphs / Maria Chudnovsky and Paul Seymour -- Designs and topology / M.J. Grannell and T.S. Griggs -- The number of points on an algebraic curve over a finite field / J.W.P. Hirschfeld, G. Korchmáros, and F. Torres -- On the efficient approximability of constraint satisfaction problems / Johan H°astad -- The combinatorics of cryptographic key establishment / Keith M. Martin -- Bandwidth of graphic matroids / Frédéric Mazoit and Stéphan Thomassé | |
| 520 | |a This 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering | ||
| 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 Hilton, Anthony |4 edt | |
| 700 | 1 | |a Talbot, J. |d 1974- |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-69823-8 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511666209 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029355008 | ||
| 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/CBO9780511666209 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511666209 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176892917448704 |
|---|---|
| any_adam_object | |
| author2 | Hilton, Anthony Talbot, J. 1974- |
| author2_role | edt edt |
| author2_variant | a h ah j t jt |
| author_corporate | British Combinatorial Conference < 2007, Reading, England> |
| author_corporate_role | aut |
| author_facet | Hilton, Anthony Talbot, J. 1974- British Combinatorial Conference < 2007, Reading, England> |
| author_sort | British Combinatorial Conference < 2007, Reading, England> |
| building | Verbundindex |
| bvnumber | BV043946037 |
| classification_rvk | SK 170 |
| collection | ZDB-20-CBO |
| contents | Hereditary and monotone propertie of combinatorial structures / Béla Bollobás -- Ordering classes of matrices of 0s and 1s / Richard A. Brualdi -- Cycle decompositions of complete graphs / Darryn Bryant -- Excluding induced subgraphs / Maria Chudnovsky and Paul Seymour -- Designs and topology / M.J. Grannell and T.S. Griggs -- The number of points on an algebraic curve over a finite field / J.W.P. Hirschfeld, G. Korchmáros, and F. Torres -- On the efficient approximability of constraint satisfaction problems / Johan H°astad -- The combinatorics of cryptographic key establishment / Keith M. Martin -- Bandwidth of graphic matroids / Frédéric Mazoit and Stéphan Thomassé |
| ctrlnum | (ZDB-20-CBO)CR9780511666209 (OCoLC)847017774 (DE-599)BVBBV043946037 |
| 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.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511666209 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03702nmm a2200505zcb4500</leader><controlfield tag="001">BV043946037</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2007 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511666209</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-66620-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511666209</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511666209</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)847017774</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043946037</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">22</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="110" ind1="2" ind2=" "><subfield code="a">British Combinatorial Conference < 2007, Reading, England></subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Surveys in combinatorics 2007</subfield><subfield code="c">edited by Anthony Hilton, John Talbot</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (vii, 286 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="490" ind1="0" ind2=" "><subfield code="a">London Mathematical Society lecture note series</subfield><subfield code="v">346</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=" "><subfield code="a">Hereditary and monotone propertie of combinatorial structures / Béla Bollobás -- Ordering classes of matrices of 0s and 1s / Richard A. Brualdi -- Cycle decompositions of complete graphs / Darryn Bryant -- Excluding induced subgraphs / Maria Chudnovsky and Paul Seymour -- Designs and topology / M.J. Grannell and T.S. Griggs -- The number of points on an algebraic curve over a finite field / J.W.P. Hirschfeld, G. Korchmáros, and F. Torres -- On the efficient approximability of constraint satisfaction problems / Johan H°astad -- The combinatorics of cryptographic key establishment / Keith M. Martin -- Bandwidth of graphic matroids / Frédéric Mazoit and Stéphan Thomassé</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering</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">Hilton, Anthony</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Talbot, J.</subfield><subfield code="d">1974-</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-69823-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511666209</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-029355008</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/CBO9780511666209</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/CBO9780511666209</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.BV043946037 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:24Z |
| institution | BVB |
| isbn | 9780511666209 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029355008 |
| oclc_num | 847017774 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (vii, 286 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | London Mathematical Society lecture note series |
| spelling | British Combinatorial Conference < 2007, Reading, England> Verfasser aut Surveys in combinatorics 2007 edited by Anthony Hilton, John Talbot Cambridge Cambridge University Press 2007 1 online resource (vii, 286 pages) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 346 Title from publisher's bibliographic system (viewed on 05 Oct 2015) Hereditary and monotone propertie of combinatorial structures / Béla Bollobás -- Ordering classes of matrices of 0s and 1s / Richard A. Brualdi -- Cycle decompositions of complete graphs / Darryn Bryant -- Excluding induced subgraphs / Maria Chudnovsky and Paul Seymour -- Designs and topology / M.J. Grannell and T.S. Griggs -- The number of points on an algebraic curve over a finite field / J.W.P. Hirschfeld, G. Korchmáros, and F. Torres -- On the efficient approximability of constraint satisfaction problems / Johan H°astad -- The combinatorics of cryptographic key establishment / Keith M. Martin -- Bandwidth of graphic matroids / Frédéric Mazoit and Stéphan Thomassé This 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering 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 Hilton, Anthony edt Talbot, J. 1974- edt Erscheint auch als Druckausgabe 978-0-521-69823-8 https://doi.org/10.1017/CBO9780511666209 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Surveys in combinatorics 2007 Hereditary and monotone propertie of combinatorial structures / Béla Bollobás -- Ordering classes of matrices of 0s and 1s / Richard A. Brualdi -- Cycle decompositions of complete graphs / Darryn Bryant -- Excluding induced subgraphs / Maria Chudnovsky and Paul Seymour -- Designs and topology / M.J. Grannell and T.S. Griggs -- The number of points on an algebraic curve over a finite field / J.W.P. Hirschfeld, G. Korchmáros, and F. Torres -- On the efficient approximability of constraint satisfaction problems / Johan H°astad -- The combinatorics of cryptographic key establishment / Keith M. Martin -- Bandwidth of graphic matroids / Frédéric Mazoit and Stéphan Thomassé Combinatorial analysis / Congresses Kombinatorik (DE-588)4031824-2 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)1071861417 |
| title | Surveys in combinatorics 2007 |
| title_auth | Surveys in combinatorics 2007 |
| title_exact_search | Surveys in combinatorics 2007 |
| title_full | Surveys in combinatorics 2007 edited by Anthony Hilton, John Talbot |
| title_fullStr | Surveys in combinatorics 2007 edited by Anthony Hilton, John Talbot |
| title_full_unstemmed | Surveys in combinatorics 2007 edited by Anthony Hilton, John Talbot |
| title_short | Surveys in combinatorics 2007 |
| title_sort | surveys in combinatorics 2007 |
| topic | Combinatorial analysis / Congresses Kombinatorik (DE-588)4031824-2 gnd |
| topic_facet | Combinatorial analysis / Congresses Kombinatorik Konferenzschrift |
| url | https://doi.org/10.1017/CBO9780511666209 |
| work_keys_str_mv | AT britishcombinatorialconference2007readingengland surveysincombinatorics2007 AT hiltonanthony surveysincombinatorics2007 AT talbotj surveysincombinatorics2007 |