Surveys in combinatorics, 1989 :: [invited papers for the Twelfth British Combinatorial Conference] /
This volume contains the invited lectures given at the Twelfth British Combinatorical Conference. The lectures survey the many areas of current research activity in combinatorics and its applications, including graph theory, designs, and probabilistic graphs. This book provides a valuable survey of...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
1989.
|
| Schriftenreihe: | London Mathematical Society lecture note series ;
141. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | This volume contains the invited lectures given at the Twelfth British Combinatorical Conference. The lectures survey the many areas of current research activity in combinatorics and its applications, including graph theory, designs, and probabilistic graphs. This book provides a valuable survey of the present status of knowledge in combinatorics for mathematicians, computer scientists and engineers. |
| Beschreibung: | 1 online resource (217 pages) |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9781461938231 1461938236 9781107359949 1107359945 9781107387270 1107387272 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn856017726 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130819s1989 enk ob 100 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d OCLCO |d E7B |d CAMBR |d OCLCO |d OCLCF |d YDXCP |d OCL |d OCLCO |d OCLCQ |d OCLCO |d COO |d OCLCQ |d OCLCO |d AGLDB |d UAB |d OCLCQ |d VTS |d REC |d STF |d AU@ |d M8D |d OCLCQ |d OCL |d AJS |d SFB |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 020 | |a 9781461938231 |q (electronic bk.) | ||
| 020 | |a 1461938236 |q (electronic bk.) | ||
| 020 | |a 9781107359949 |q (electronic bk.) | ||
| 020 | |a 1107359945 |q (electronic bk.) | ||
| 020 | |a 9781107387270 |q (e-book) | ||
| 020 | |a 1107387272 |q (e-book) | ||
| 020 | |z 0521378230 | ||
| 020 | |z 9780521378239 | ||
| 035 | |a (OCoLC)856017726 | ||
| 050 | 4 | |a QA164 |b .B74 1989eb | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 7 | |a 511.6 |2 22 | |
| 084 | |a *00B25 |2 msc | ||
| 084 | |a 05-06 |2 msc | ||
| 049 | |a MAIN | ||
| 111 | 2 | |a British Combinatorial Conference |n (12th : |d 1989 : |c Norwich, England) | |
| 245 | 1 | 0 | |a Surveys in combinatorics, 1989 : |b [invited papers for the Twelfth British Combinatorial Conference] / |c edited by Johannes Siemons. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 1989. | ||
| 300 | |a 1 online resource (217 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a London Mathematical Society lecture note series ; |v 141 | |
| 504 | |a Includes bibliographical references. | ||
| 588 | 0 | |a Print version record. | |
| 520 | |a This volume contains the invited lectures given at the Twelfth British Combinatorical Conference. The lectures survey the many areas of current research activity in combinatorics and its applications, including graph theory, designs, and probabilistic graphs. This book provides a valuable survey of the present status of knowledge in combinatorics for mathematicians, computer scientists and engineers. | ||
| 505 | 0 | |a Cover; Series Page; Title; Copyright; PREFACE; CONTENTS; On the theory of designs; INTRODUCTION; THE CODE AND THE HULL OF A DESIGN; THE HULL OF AN AFFINE PLANE; THE HAMADA-SACHAR CONJECTURE AND TRANSLATION PLANES; DERIVATIONS; CONCLUSION; APPENDIX; ADMISSIBLE PARAMETERS FOR DESIGNS; REFERENCES; Designs: mappings between structured sets; 1 Structured sets; 2 Fractional factorials; 3 Factorial structures; 4 Strata; 5 Incomplete-block designs; 6 General balance; 7 Randomization; 8 Neighbour designs; References; DEVELOPMENTS BASED ON RADO'S DISSERTATION: ""Studien zur Kombinatorik"" | |
| 505 | 8 | |a I. PARTITION REGULAR MATRICESII. (m, p, c)-SETS; III. COMBINATORIAL LINES AND PARAMETER SETS; IV. GRAPHS WITH ARITHMETIC STRUCTURE; V. CANONIZING RAMSEY THEORY; References; DESIGNS AND AUTOMORPHISM GROUPS; INTRODUCTION; FLAG-TRANSITIVE 2-(v, k, l) DESIGNS; TWO APPLICATIONS; REFERENCES; ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS; 1. Introduction; 2. ""Proofs"" of Theorems 1.1 and 1.2; 3. Generalisations; 4. Regular Graphs, k-out and Planar Maps; 5. Algorithmic Aspects; Weighted Problems; 6. Digraphs; 7. Open Problems; References; Decompositions of complete bipartite graphs | |
| 505 | 8 | |a 0. Setting the stage1. A small detour. Some connections with latin squares; 2. The Ringel conjecture; 3. The Oberwolfach problem; 4. Main results; References; ON THE METHOD OF BOUNDED DIFFERENCES; 1 Introduction; 2 Colouring random graphs -- before and after; 3 Colouring random graphs -- proofs; (a) General lemmas; (b) Concentration of X[Gn, p]; (c) Stable sets in Gn, p; (d) Colouring Gnp; (e) Stability number of sparse random graphs; 4 Martingales; 5 Inequalities for bounded independent summands; (a) Results; (b) Proofs; 6 Inequalities for bounded martingale difference sequences | |
| 505 | 8 | |a (A) Results(b) Proofs; (c) Inequalities for maxima; 7 Isoperimetiic inequalities for graphs; (a) General results; (b) Exact isoperimetric inequalities; (c) Two results of Alon and Milman; (d) Monotonic functions; 8 Applications in operational research and computer science; (a) Bin packing; (b) Knapsack problems; (c) Travelling salesman problem; (d) Minimum spanning trees; (e) Second eigenvalue of random regular graphs; (f) Heap building; 9 Concluding Remarks; References; ON THE USE OF REGULAR ARRAYS IN THE CONSTRUCTION OF t-DESIGNS; 1. INTRODUCTION; 2. PRELIMINARY DEFINITIONS AND RESULTS | |
| 650 | 0 | |a Combinatorial analysis |v Congresses. | |
| 650 | 6 | |a Analyse combinatoire |v Congrès. | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Combinatorial analysis |2 fast | |
| 650 | 7 | |a Combinatória (congressos) |2 larpcal | |
| 650 | 7 | |a Analyse combinatoire |x Congrès. |2 ram | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 700 | 1 | |a Siemons, Johannes. | |
| 758 | |i has work: |a Surveys in combinatorics, 1989 (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFP7hWppxvdhFgj4T4PWjC |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a British Combinatorial Conference (12th : 1989 : Norwich, England). |t Surveys in combinatorics, 1989. |d Cambridge ; New York : Cambridge University Press, 1989 |z 0521378230 |w (DLC) 89210928 |w (OCoLC)20401990 |
| 830 | 0 | |a London Mathematical Society lecture note series ; |v 141. |0 http://id.loc.gov/authorities/names/n42015587 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616984 |3 Volltext |
| 938 | |a ebrary |b EBRY |n ebr10746232 | ||
| 938 | |a EBSCOhost |b EBSC |n 616984 | ||
| 938 | |a YBP Library Services |b YANK |n 11063955 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn856017726 |
|---|---|
| _version_ | 1816882241818591232 |
| adam_text | |
| any_adam_object | |
| author2 | Siemons, Johannes |
| author2_role | |
| author2_variant | j s js |
| author_corporate | British Combinatorial Conference Norwich, England |
| author_corporate_role | |
| author_facet | Siemons, Johannes British Combinatorial Conference Norwich, England |
| author_sort | British Combinatorial Conference Norwich, England |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA164 |
| callnumber-raw | QA164 .B74 1989eb |
| callnumber-search | QA164 .B74 1989eb |
| callnumber-sort | QA 3164 B74 41989EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Cover; Series Page; Title; Copyright; PREFACE; CONTENTS; On the theory of designs; INTRODUCTION; THE CODE AND THE HULL OF A DESIGN; THE HULL OF AN AFFINE PLANE; THE HAMADA-SACHAR CONJECTURE AND TRANSLATION PLANES; DERIVATIONS; CONCLUSION; APPENDIX; ADMISSIBLE PARAMETERS FOR DESIGNS; REFERENCES; Designs: mappings between structured sets; 1 Structured sets; 2 Fractional factorials; 3 Factorial structures; 4 Strata; 5 Incomplete-block designs; 6 General balance; 7 Randomization; 8 Neighbour designs; References; DEVELOPMENTS BASED ON RADO'S DISSERTATION: ""Studien zur Kombinatorik"" I. PARTITION REGULAR MATRICESII. (m, p, c)-SETS; III. COMBINATORIAL LINES AND PARAMETER SETS; IV. GRAPHS WITH ARITHMETIC STRUCTURE; V. CANONIZING RAMSEY THEORY; References; DESIGNS AND AUTOMORPHISM GROUPS; INTRODUCTION; FLAG-TRANSITIVE 2-(v, k, l) DESIGNS; TWO APPLICATIONS; REFERENCES; ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS; 1. Introduction; 2. ""Proofs"" of Theorems 1.1 and 1.2; 3. Generalisations; 4. Regular Graphs, k-out and Planar Maps; 5. Algorithmic Aspects; Weighted Problems; 6. Digraphs; 7. Open Problems; References; Decompositions of complete bipartite graphs 0. Setting the stage1. A small detour. Some connections with latin squares; 2. The Ringel conjecture; 3. The Oberwolfach problem; 4. Main results; References; ON THE METHOD OF BOUNDED DIFFERENCES; 1 Introduction; 2 Colouring random graphs -- before and after; 3 Colouring random graphs -- proofs; (a) General lemmas; (b) Concentration of X[Gn, p]; (c) Stable sets in Gn, p; (d) Colouring Gnp; (e) Stability number of sparse random graphs; 4 Martingales; 5 Inequalities for bounded independent summands; (a) Results; (b) Proofs; 6 Inequalities for bounded martingale difference sequences (A) Results(b) Proofs; (c) Inequalities for maxima; 7 Isoperimetiic inequalities for graphs; (a) General results; (b) Exact isoperimetric inequalities; (c) Two results of Alon and Milman; (d) Monotonic functions; 8 Applications in operational research and computer science; (a) Bin packing; (b) Knapsack problems; (c) Travelling salesman problem; (d) Minimum spanning trees; (e) Second eigenvalue of random regular graphs; (f) Heap building; 9 Concluding Remarks; References; ON THE USE OF REGULAR ARRAYS IN THE CONSTRUCTION OF t-DESIGNS; 1. INTRODUCTION; 2. PRELIMINARY DEFINITIONS AND RESULTS |
| ctrlnum | (OCoLC)856017726 |
| 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 |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05615cam a2200661 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn856017726</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130819s1989 enk ob 100 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">OCLCO</subfield><subfield code="d">E7B</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">AGLDB</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">REC</subfield><subfield code="d">STF</subfield><subfield code="d">AU@</subfield><subfield code="d">M8D</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">AJS</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461938231</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1461938236</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107359949</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107359945</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107387270</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107387272</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521378230</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521378239</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)856017726</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA164</subfield><subfield code="b">.B74 1989eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">*00B25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">British Combinatorial Conference</subfield><subfield code="n">(12th :</subfield><subfield code="d">1989 :</subfield><subfield code="c">Norwich, England)</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Surveys in combinatorics, 1989 :</subfield><subfield code="b">[invited papers for the Twelfth British Combinatorial Conference] /</subfield><subfield code="c">edited by Johannes Siemons.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">1989.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (217 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">141</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This volume contains the invited lectures given at the Twelfth British Combinatorical Conference. The lectures survey the many areas of current research activity in combinatorics and its applications, including graph theory, designs, and probabilistic graphs. This book provides a valuable survey of the present status of knowledge in combinatorics for mathematicians, computer scientists and engineers.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Cover; Series Page; Title; Copyright; PREFACE; CONTENTS; On the theory of designs; INTRODUCTION; THE CODE AND THE HULL OF A DESIGN; THE HULL OF AN AFFINE PLANE; THE HAMADA-SACHAR CONJECTURE AND TRANSLATION PLANES; DERIVATIONS; CONCLUSION; APPENDIX; ADMISSIBLE PARAMETERS FOR DESIGNS; REFERENCES; Designs: mappings between structured sets; 1 Structured sets; 2 Fractional factorials; 3 Factorial structures; 4 Strata; 5 Incomplete-block designs; 6 General balance; 7 Randomization; 8 Neighbour designs; References; DEVELOPMENTS BASED ON RADO'S DISSERTATION: ""Studien zur Kombinatorik""</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">I. PARTITION REGULAR MATRICESII. (m, p, c)-SETS; III. COMBINATORIAL LINES AND PARAMETER SETS; IV. GRAPHS WITH ARITHMETIC STRUCTURE; V. CANONIZING RAMSEY THEORY; References; DESIGNS AND AUTOMORPHISM GROUPS; INTRODUCTION; FLAG-TRANSITIVE 2-(v, k, l) DESIGNS; TWO APPLICATIONS; REFERENCES; ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS; 1. Introduction; 2. ""Proofs"" of Theorems 1.1 and 1.2; 3. Generalisations; 4. Regular Graphs, k-out and Planar Maps; 5. Algorithmic Aspects; Weighted Problems; 6. Digraphs; 7. Open Problems; References; Decompositions of complete bipartite graphs</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">0. Setting the stage1. A small detour. Some connections with latin squares; 2. The Ringel conjecture; 3. The Oberwolfach problem; 4. Main results; References; ON THE METHOD OF BOUNDED DIFFERENCES; 1 Introduction; 2 Colouring random graphs -- before and after; 3 Colouring random graphs -- proofs; (a) General lemmas; (b) Concentration of X[Gn, p]; (c) Stable sets in Gn, p; (d) Colouring Gnp; (e) Stability number of sparse random graphs; 4 Martingales; 5 Inequalities for bounded independent summands; (a) Results; (b) Proofs; 6 Inequalities for bounded martingale difference sequences</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">(A) Results(b) Proofs; (c) Inequalities for maxima; 7 Isoperimetiic inequalities for graphs; (a) General results; (b) Exact isoperimetric inequalities; (c) Two results of Alon and Milman; (d) Monotonic functions; 8 Applications in operational research and computer science; (a) Bin packing; (b) Knapsack problems; (c) Travelling salesman problem; (d) Minimum spanning trees; (e) Second eigenvalue of random regular graphs; (f) Heap building; 9 Concluding Remarks; References; ON THE USE OF REGULAR ARRAYS IN THE CONSTRUCTION OF t-DESIGNS; 1. INTRODUCTION; 2. PRELIMINARY DEFINITIONS AND RESULTS</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Analyse combinatoire</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial analysis</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatória (congressos)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse combinatoire</subfield><subfield code="x">Congrès.</subfield><subfield code="2">ram</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Conference papers and proceedings</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Siemons, Johannes.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Surveys in combinatorics, 1989 (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCFP7hWppxvdhFgj4T4PWjC</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">British Combinatorial Conference (12th : 1989 : Norwich, England).</subfield><subfield code="t">Surveys in combinatorics, 1989.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 1989</subfield><subfield code="z">0521378230</subfield><subfield code="w">(DLC) 89210928</subfield><subfield code="w">(OCoLC)20401990</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">141.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42015587</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616984</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10746232</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">616984</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">11063955</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Conference papers and proceedings fast |
| genre_facet | Conference papers and proceedings |
| id | ZDB-4-EBA-ocn856017726 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:25:29Z |
| institution | BVB |
| isbn | 9781461938231 1461938236 9781107359949 1107359945 9781107387270 1107387272 |
| language | English |
| oclc_num | 856017726 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (217 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | London Mathematical Society lecture note series ; |
| series2 | London Mathematical Society lecture note series ; |
| spelling | British Combinatorial Conference (12th : 1989 : Norwich, England) Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / edited by Johannes Siemons. Cambridge ; New York : Cambridge University Press, 1989. 1 online resource (217 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier London Mathematical Society lecture note series ; 141 Includes bibliographical references. Print version record. This volume contains the invited lectures given at the Twelfth British Combinatorical Conference. The lectures survey the many areas of current research activity in combinatorics and its applications, including graph theory, designs, and probabilistic graphs. This book provides a valuable survey of the present status of knowledge in combinatorics for mathematicians, computer scientists and engineers. Cover; Series Page; Title; Copyright; PREFACE; CONTENTS; On the theory of designs; INTRODUCTION; THE CODE AND THE HULL OF A DESIGN; THE HULL OF AN AFFINE PLANE; THE HAMADA-SACHAR CONJECTURE AND TRANSLATION PLANES; DERIVATIONS; CONCLUSION; APPENDIX; ADMISSIBLE PARAMETERS FOR DESIGNS; REFERENCES; Designs: mappings between structured sets; 1 Structured sets; 2 Fractional factorials; 3 Factorial structures; 4 Strata; 5 Incomplete-block designs; 6 General balance; 7 Randomization; 8 Neighbour designs; References; DEVELOPMENTS BASED ON RADO'S DISSERTATION: ""Studien zur Kombinatorik"" I. PARTITION REGULAR MATRICESII. (m, p, c)-SETS; III. COMBINATORIAL LINES AND PARAMETER SETS; IV. GRAPHS WITH ARITHMETIC STRUCTURE; V. CANONIZING RAMSEY THEORY; References; DESIGNS AND AUTOMORPHISM GROUPS; INTRODUCTION; FLAG-TRANSITIVE 2-(v, k, l) DESIGNS; TWO APPLICATIONS; REFERENCES; ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS; 1. Introduction; 2. ""Proofs"" of Theorems 1.1 and 1.2; 3. Generalisations; 4. Regular Graphs, k-out and Planar Maps; 5. Algorithmic Aspects; Weighted Problems; 6. Digraphs; 7. Open Problems; References; Decompositions of complete bipartite graphs 0. Setting the stage1. A small detour. Some connections with latin squares; 2. The Ringel conjecture; 3. The Oberwolfach problem; 4. Main results; References; ON THE METHOD OF BOUNDED DIFFERENCES; 1 Introduction; 2 Colouring random graphs -- before and after; 3 Colouring random graphs -- proofs; (a) General lemmas; (b) Concentration of X[Gn, p]; (c) Stable sets in Gn, p; (d) Colouring Gnp; (e) Stability number of sparse random graphs; 4 Martingales; 5 Inequalities for bounded independent summands; (a) Results; (b) Proofs; 6 Inequalities for bounded martingale difference sequences (A) Results(b) Proofs; (c) Inequalities for maxima; 7 Isoperimetiic inequalities for graphs; (a) General results; (b) Exact isoperimetric inequalities; (c) Two results of Alon and Milman; (d) Monotonic functions; 8 Applications in operational research and computer science; (a) Bin packing; (b) Knapsack problems; (c) Travelling salesman problem; (d) Minimum spanning trees; (e) Second eigenvalue of random regular graphs; (f) Heap building; 9 Concluding Remarks; References; ON THE USE OF REGULAR ARRAYS IN THE CONSTRUCTION OF t-DESIGNS; 1. INTRODUCTION; 2. PRELIMINARY DEFINITIONS AND RESULTS Combinatorial analysis Congresses. Analyse combinatoire Congrès. MATHEMATICS General. bisacsh Combinatorial analysis fast Combinatória (congressos) larpcal Analyse combinatoire Congrès. ram Conference papers and proceedings fast Siemons, Johannes. has work: Surveys in combinatorics, 1989 (Text) https://id.oclc.org/worldcat/entity/E39PCFP7hWppxvdhFgj4T4PWjC https://id.oclc.org/worldcat/ontology/hasWork Print version: British Combinatorial Conference (12th : 1989 : Norwich, England). Surveys in combinatorics, 1989. Cambridge ; New York : Cambridge University Press, 1989 0521378230 (DLC) 89210928 (OCoLC)20401990 London Mathematical Society lecture note series ; 141. http://id.loc.gov/authorities/names/n42015587 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616984 Volltext |
| spellingShingle | Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / London Mathematical Society lecture note series ; Cover; Series Page; Title; Copyright; PREFACE; CONTENTS; On the theory of designs; INTRODUCTION; THE CODE AND THE HULL OF A DESIGN; THE HULL OF AN AFFINE PLANE; THE HAMADA-SACHAR CONJECTURE AND TRANSLATION PLANES; DERIVATIONS; CONCLUSION; APPENDIX; ADMISSIBLE PARAMETERS FOR DESIGNS; REFERENCES; Designs: mappings between structured sets; 1 Structured sets; 2 Fractional factorials; 3 Factorial structures; 4 Strata; 5 Incomplete-block designs; 6 General balance; 7 Randomization; 8 Neighbour designs; References; DEVELOPMENTS BASED ON RADO'S DISSERTATION: ""Studien zur Kombinatorik"" I. PARTITION REGULAR MATRICESII. (m, p, c)-SETS; III. COMBINATORIAL LINES AND PARAMETER SETS; IV. GRAPHS WITH ARITHMETIC STRUCTURE; V. CANONIZING RAMSEY THEORY; References; DESIGNS AND AUTOMORPHISM GROUPS; INTRODUCTION; FLAG-TRANSITIVE 2-(v, k, l) DESIGNS; TWO APPLICATIONS; REFERENCES; ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS; 1. Introduction; 2. ""Proofs"" of Theorems 1.1 and 1.2; 3. Generalisations; 4. Regular Graphs, k-out and Planar Maps; 5. Algorithmic Aspects; Weighted Problems; 6. Digraphs; 7. Open Problems; References; Decompositions of complete bipartite graphs 0. Setting the stage1. A small detour. Some connections with latin squares; 2. The Ringel conjecture; 3. The Oberwolfach problem; 4. Main results; References; ON THE METHOD OF BOUNDED DIFFERENCES; 1 Introduction; 2 Colouring random graphs -- before and after; 3 Colouring random graphs -- proofs; (a) General lemmas; (b) Concentration of X[Gn, p]; (c) Stable sets in Gn, p; (d) Colouring Gnp; (e) Stability number of sparse random graphs; 4 Martingales; 5 Inequalities for bounded independent summands; (a) Results; (b) Proofs; 6 Inequalities for bounded martingale difference sequences (A) Results(b) Proofs; (c) Inequalities for maxima; 7 Isoperimetiic inequalities for graphs; (a) General results; (b) Exact isoperimetric inequalities; (c) Two results of Alon and Milman; (d) Monotonic functions; 8 Applications in operational research and computer science; (a) Bin packing; (b) Knapsack problems; (c) Travelling salesman problem; (d) Minimum spanning trees; (e) Second eigenvalue of random regular graphs; (f) Heap building; 9 Concluding Remarks; References; ON THE USE OF REGULAR ARRAYS IN THE CONSTRUCTION OF t-DESIGNS; 1. INTRODUCTION; 2. PRELIMINARY DEFINITIONS AND RESULTS Combinatorial analysis Congresses. Analyse combinatoire Congrès. MATHEMATICS General. bisacsh Combinatorial analysis fast Combinatória (congressos) larpcal Analyse combinatoire Congrès. ram |
| title | Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / |
| title_auth | Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / |
| title_exact_search | Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / |
| title_full | Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / edited by Johannes Siemons. |
| title_fullStr | Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / edited by Johannes Siemons. |
| title_full_unstemmed | Surveys in combinatorics, 1989 : [invited papers for the Twelfth British Combinatorial Conference] / edited by Johannes Siemons. |
| title_short | Surveys in combinatorics, 1989 : |
| title_sort | surveys in combinatorics 1989 invited papers for the twelfth british combinatorial conference |
| title_sub | [invited papers for the Twelfth British Combinatorial Conference] / |
| topic | Combinatorial analysis Congresses. Analyse combinatoire Congrès. MATHEMATICS General. bisacsh Combinatorial analysis fast Combinatória (congressos) larpcal Analyse combinatoire Congrès. ram |
| topic_facet | Combinatorial analysis Congresses. Analyse combinatoire Congrès. MATHEMATICS General. Combinatorial analysis Combinatória (congressos) Conference papers and proceedings |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616984 |
| work_keys_str_mv | AT britishcombinatorialconferencenorwichengland surveysincombinatorics1989invitedpapersforthetwelfthbritishcombinatorialconference AT siemonsjohannes surveysincombinatorics1989invitedpapersforthetwelfthbritishcombinatorialconference |