Surveys in Combinatorics 2011.:
Survey articles based on the invited lectures given at the 23rd British Combinatorial Conference.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge :
Cambridge University Press,
2011.
|
| Schriftenreihe: | London Mathematical Society Lecture Note Series, 392.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Survey articles based on the invited lectures given at the 23rd British Combinatorial Conference. |
| Beschreibung: | 2.2 Erdos-Stone type problems. |
| Beschreibung: | 1 online resource (448 pages) |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9781139101196 1139101196 9781139099875 1139099876 9781139101851 1139101854 9781139004114 1139004115 |
Internformat
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn769342114 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 111226s2011 enk ob 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d MHW |d MUM |d OCLCQ |d AUD |d OCLCO |d DEBSZ |d OCLCQ |d OCLCO |d OCLCF |d OSU |d YDXCP |d E7B |d N$T |d REDDC |d CAMBR |d OCLCQ |d VGM |d OCLCQ |d UAB |d OCLCQ |d INT |d OCLCQ |d LUN |d UKAHL |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d AU@ |d OCLCO |d OCLCQ |d OCLCO |d OCLCQ | ||
| 019 | |a 767725221 |a 770097756 |a 818635143 |a 1170281072 |a 1170806321 |a 1264975509 |a 1422280385 |a 1433233109 | ||
| 020 | |a 9781139101196 | ||
| 020 | |a 1139101196 | ||
| 020 | |a 9781139099875 |q (electronic bk.) | ||
| 020 | |a 1139099876 |q (electronic bk.) | ||
| 020 | |a 9781139101851 |q (electronic bk.) | ||
| 020 | |a 1139101854 |q (electronic bk.) | ||
| 020 | |a 9781139004114 |q (electronic bk.) | ||
| 020 | |a 1139004115 |q (electronic bk.) | ||
| 020 | |z 9781107601093 |q (pbk.) | ||
| 020 | |z 1107601096 |q (pbk.) | ||
| 035 | |a (OCoLC)769342114 |z (OCoLC)767725221 |z (OCoLC)770097756 |z (OCoLC)818635143 |z (OCoLC)1170281072 |z (OCoLC)1170806321 |z (OCoLC)1264975509 |z (OCoLC)1422280385 |z (OCoLC)1433233109 | ||
| 050 | 4 | |a QA164 .S887 2011 | |
| 072 | 7 | |a MAT |x 036000 |2 bisacsh | |
| 082 | 7 | |a 511.6 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Chapman, Robin |q (Robin John) |1 https://id.oclc.org/worldcat/entity/E39PCjtWq3Rm7X7GrXYpMHcqw3 |0 http://id.loc.gov/authorities/names/no2012020236 | |
| 245 | 1 | 0 | |a Surveys in Combinatorics 2011. |
| 260 | |a Cambridge : |b Cambridge University Press, |c 2011. | ||
| 300 | |a 1 online resource (448 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, 392 ; |v v. 392 | |
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Cover; LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES; Title; Copyright; Contents; Preface; Counting planar maps, coloured or uncoloured; 1 Introduction; 2 Definitions and notation; 2.1 Planar maps; 2.2 Power series; 2.3 The Potts model and the Tutte polynomial; 3 Uncoloured planar maps: the recursive approach; 3.1 A functional equation for planar maps; 3.2 More functional equations; Maps with prescribed face degrees; Eulerian maps with prescribed face degrees; Other families of maps; 3.3 Equations with one catalytic variable and algebraicity theorems; Algebraicity results. | |
| 505 | 8 | |a Where is the quadratic method?4 Uncoloured planar maps: bijections; 4.1 Two proofs from The Book?; Four-valent maps and blossoming trees; A more general construction; Quadrangulations and labelled trees; 4.2 More bijections; 5 Coloured planar maps: the recursive approach; 5.1 A functional equation for coloured planar maps; 5.2 More functional equations; 5.3 A linear case: bipolar orientations of maps; 5.4 A quasi-linear case: spanning trees; 5.5 When q is a Beraha number: Algebraicity; 5.6 The general case: differential equations; Comments; 6 Some bijections for coloured planar maps. | |
| 505 | 8 | |a 6.1 Bipolar orientations of maps6.2 Spanning trees; 6.3 The Ising model (q = 2); 7 Final comments and questions; 7.1 Algebraicity; 7.2 Bijections; 7.3 Asymptotics of maps; Acknowledgements; References; A survey of PPAD-completeness for computing Nash equilibria; Acknowledgements; 1 Total Search Problems; 1.1 NP Total Search Problems; 1.2 Reducibility among total search problems; 1.3 PPAD, and some related concepts; 2 Sperner's lemma, and an associated computational problem; 3 Games and Nash Equilibria; 3.1 Some reductions among equilibrium problems; 3.2 The "in PPAD" result. | |
| 505 | 8 | |a 3.3 The Algebraic Properties of Nash Equilibria4 Brouwer functions, and discrete Brouwer functions; 4.1 Discrete Brouwer functions; 5 From Discrete Brouwer functions to Games; 5.1 Graphical Games; 5.2 From graphical to normal-form games; 6 Easy and hard classes of games; 6.1 Hard equilibrium computation problems; 6.2 Polynomial-time equilibrium computation problems; 7 The Complexity of Path-following Algorithms; 8 From Games to Markets; References; Hypergraph Turán problems; Acknowledgements; 1 Introduction; 2 Basic arguments; 3 Hypergraph Lagrangians; 4 Link graphs and multigraphs. | |
| 505 | 8 | |a 5 Stability6 Counting; 7 Flag algebras; 8 The remaining exact results; 9 Bounds for complete hypergraphs; 10 The infinitary perspective; 11 Algebraic methods; 12 Probabilistic methods; 13 Further topics; 13.1 Jumps; 13.2 Minimum degree problems; 13.3 Different host graphs; 13.4 Coloured Turán problems; 13.5 The speed of properties; 13.6 Local sparsity; 13.7 Counting subgraphs; 14 Summary of results; References; Some new results in extremal graph theory; Contents; 1 Introduction; 2 New results on classical extremal graph problems; 2.1 The extremal problems that are studied. | |
| 500 | |a 2.2 Erdos-Stone type problems. | ||
| 520 | |a Survey articles based on the invited lectures given at the 23rd British Combinatorial Conference. | ||
| 504 | |a Includes bibliographical references. | ||
| 650 | 0 | |a Combinatorial analysis. |0 http://id.loc.gov/authorities/subjects/sh85028802 | |
| 650 | 0 | |a Graph theory. |0 http://id.loc.gov/authorities/subjects/sh85056471 | |
| 650 | 6 | |a Analyse combinatoire. | |
| 650 | 7 | |a MATHEMATICS |x Combinatorics. |2 bisacsh | |
| 650 | 7 | |a Combinatorial analysis |2 fast | |
| 650 | 7 | |a Graph theory |2 fast | |
| 776 | 0 | 8 | |i Print version: |a Chapman, Robin. |t Surveys in Combinatorics 2011. |d Cambridge : Cambridge University Press, ©2011 |z 9781107601093 |
| 830 | 0 | |a London Mathematical Society Lecture Note Series, 392. | |
| 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=375976 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH16077534 | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL803067 | ||
| 938 | |a ebrary |b EBRY |n ebr10504872 | ||
| 938 | |a EBSCOhost |b EBSC |n 375976 | ||
| 938 | |a YBP Library Services |b YANK |n 7050864 | ||
| 938 | |a YBP Library Services |b YANK |n 7214770 | ||
| 938 | |a YBP Library Services |b YANK |n 7302814 | ||
| 938 | |a YBP Library Services |b YANK |n 7353953 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn769342114 |
|---|---|
| _version_ | 1816881780998799361 |
| adam_text | |
| any_adam_object | |
| author | Chapman, Robin (Robin John) |
| author_GND | http://id.loc.gov/authorities/names/no2012020236 |
| author_facet | Chapman, Robin (Robin John) |
| author_role | |
| author_sort | Chapman, Robin |
| author_variant | r c rc |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA164 |
| callnumber-raw | QA164 .S887 2011 |
| callnumber-search | QA164 .S887 2011 |
| callnumber-sort | QA 3164 S887 42011 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Cover; LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES; Title; Copyright; Contents; Preface; Counting planar maps, coloured or uncoloured; 1 Introduction; 2 Definitions and notation; 2.1 Planar maps; 2.2 Power series; 2.3 The Potts model and the Tutte polynomial; 3 Uncoloured planar maps: the recursive approach; 3.1 A functional equation for planar maps; 3.2 More functional equations; Maps with prescribed face degrees; Eulerian maps with prescribed face degrees; Other families of maps; 3.3 Equations with one catalytic variable and algebraicity theorems; Algebraicity results. Where is the quadratic method?4 Uncoloured planar maps: bijections; 4.1 Two proofs from The Book?; Four-valent maps and blossoming trees; A more general construction; Quadrangulations and labelled trees; 4.2 More bijections; 5 Coloured planar maps: the recursive approach; 5.1 A functional equation for coloured planar maps; 5.2 More functional equations; 5.3 A linear case: bipolar orientations of maps; 5.4 A quasi-linear case: spanning trees; 5.5 When q is a Beraha number: Algebraicity; 5.6 The general case: differential equations; Comments; 6 Some bijections for coloured planar maps. 6.1 Bipolar orientations of maps6.2 Spanning trees; 6.3 The Ising model (q = 2); 7 Final comments and questions; 7.1 Algebraicity; 7.2 Bijections; 7.3 Asymptotics of maps; Acknowledgements; References; A survey of PPAD-completeness for computing Nash equilibria; Acknowledgements; 1 Total Search Problems; 1.1 NP Total Search Problems; 1.2 Reducibility among total search problems; 1.3 PPAD, and some related concepts; 2 Sperner's lemma, and an associated computational problem; 3 Games and Nash Equilibria; 3.1 Some reductions among equilibrium problems; 3.2 The "in PPAD" result. 3.3 The Algebraic Properties of Nash Equilibria4 Brouwer functions, and discrete Brouwer functions; 4.1 Discrete Brouwer functions; 5 From Discrete Brouwer functions to Games; 5.1 Graphical Games; 5.2 From graphical to normal-form games; 6 Easy and hard classes of games; 6.1 Hard equilibrium computation problems; 6.2 Polynomial-time equilibrium computation problems; 7 The Complexity of Path-following Algorithms; 8 From Games to Markets; References; Hypergraph Turán problems; Acknowledgements; 1 Introduction; 2 Basic arguments; 3 Hypergraph Lagrangians; 4 Link graphs and multigraphs. 5 Stability6 Counting; 7 Flag algebras; 8 The remaining exact results; 9 Bounds for complete hypergraphs; 10 The infinitary perspective; 11 Algebraic methods; 12 Probabilistic methods; 13 Further topics; 13.1 Jumps; 13.2 Minimum degree problems; 13.3 Different host graphs; 13.4 Coloured Turán problems; 13.5 The speed of properties; 13.6 Local sparsity; 13.7 Counting subgraphs; 14 Summary of results; References; Some new results in extremal graph theory; Contents; 1 Introduction; 2 New results on classical extremal graph problems; 2.1 The extremal problems that are studied. |
| ctrlnum | (OCoLC)769342114 |
| 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 eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06139cam a2200721Mu 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn769342114</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|---|||||</controlfield><controlfield tag="008">111226s2011 enk ob 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">MHW</subfield><subfield code="d">MUM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AUD</subfield><subfield code="d">OCLCO</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OSU</subfield><subfield code="d">YDXCP</subfield><subfield code="d">E7B</subfield><subfield code="d">N$T</subfield><subfield code="d">REDDC</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VGM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INT</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LUN</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">767725221</subfield><subfield code="a">770097756</subfield><subfield code="a">818635143</subfield><subfield code="a">1170281072</subfield><subfield code="a">1170806321</subfield><subfield code="a">1264975509</subfield><subfield code="a">1422280385</subfield><subfield code="a">1433233109</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139101196</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139101196</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139099875</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139099876</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139101851</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139101854</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139004114</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139004115</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781107601093</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1107601096</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)769342114</subfield><subfield code="z">(OCoLC)767725221</subfield><subfield code="z">(OCoLC)770097756</subfield><subfield code="z">(OCoLC)818635143</subfield><subfield code="z">(OCoLC)1170281072</subfield><subfield code="z">(OCoLC)1170806321</subfield><subfield code="z">(OCoLC)1264975509</subfield><subfield code="z">(OCoLC)1422280385</subfield><subfield code="z">(OCoLC)1433233109</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA164 .S887 2011</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">036000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.6</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chapman, Robin</subfield><subfield code="q">(Robin John)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjtWq3Rm7X7GrXYpMHcqw3</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2012020236</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Surveys in Combinatorics 2011.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (448 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, 392 ;</subfield><subfield code="v">v. 392</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Cover; LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES; Title; Copyright; Contents; Preface; Counting planar maps, coloured or uncoloured; 1 Introduction; 2 Definitions and notation; 2.1 Planar maps; 2.2 Power series; 2.3 The Potts model and the Tutte polynomial; 3 Uncoloured planar maps: the recursive approach; 3.1 A functional equation for planar maps; 3.2 More functional equations; Maps with prescribed face degrees; Eulerian maps with prescribed face degrees; Other families of maps; 3.3 Equations with one catalytic variable and algebraicity theorems; Algebraicity results.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Where is the quadratic method?4 Uncoloured planar maps: bijections; 4.1 Two proofs from The Book?; Four-valent maps and blossoming trees; A more general construction; Quadrangulations and labelled trees; 4.2 More bijections; 5 Coloured planar maps: the recursive approach; 5.1 A functional equation for coloured planar maps; 5.2 More functional equations; 5.3 A linear case: bipolar orientations of maps; 5.4 A quasi-linear case: spanning trees; 5.5 When q is a Beraha number: Algebraicity; 5.6 The general case: differential equations; Comments; 6 Some bijections for coloured planar maps.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">6.1 Bipolar orientations of maps6.2 Spanning trees; 6.3 The Ising model (q = 2); 7 Final comments and questions; 7.1 Algebraicity; 7.2 Bijections; 7.3 Asymptotics of maps; Acknowledgements; References; A survey of PPAD-completeness for computing Nash equilibria; Acknowledgements; 1 Total Search Problems; 1.1 NP Total Search Problems; 1.2 Reducibility among total search problems; 1.3 PPAD, and some related concepts; 2 Sperner's lemma, and an associated computational problem; 3 Games and Nash Equilibria; 3.1 Some reductions among equilibrium problems; 3.2 The "in PPAD" result.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">3.3 The Algebraic Properties of Nash Equilibria4 Brouwer functions, and discrete Brouwer functions; 4.1 Discrete Brouwer functions; 5 From Discrete Brouwer functions to Games; 5.1 Graphical Games; 5.2 From graphical to normal-form games; 6 Easy and hard classes of games; 6.1 Hard equilibrium computation problems; 6.2 Polynomial-time equilibrium computation problems; 7 The Complexity of Path-following Algorithms; 8 From Games to Markets; References; Hypergraph Turán problems; Acknowledgements; 1 Introduction; 2 Basic arguments; 3 Hypergraph Lagrangians; 4 Link graphs and multigraphs.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">5 Stability6 Counting; 7 Flag algebras; 8 The remaining exact results; 9 Bounds for complete hypergraphs; 10 The infinitary perspective; 11 Algebraic methods; 12 Probabilistic methods; 13 Further topics; 13.1 Jumps; 13.2 Minimum degree problems; 13.3 Different host graphs; 13.4 Coloured Turán problems; 13.5 The speed of properties; 13.6 Local sparsity; 13.7 Counting subgraphs; 14 Summary of results; References; Some new results in extremal graph theory; Contents; 1 Introduction; 2 New results on classical extremal graph problems; 2.1 The extremal problems that are studied.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">2.2 Erdos-Stone type problems.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Survey articles based on the invited lectures given at the 23rd British Combinatorial Conference.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85028802</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85056471</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Analyse combinatoire.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Combinatorics.</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">Graph theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Chapman, Robin.</subfield><subfield code="t">Surveys in Combinatorics 2011.</subfield><subfield code="d">Cambridge : Cambridge University Press, ©2011</subfield><subfield code="z">9781107601093</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society Lecture Note Series, 392.</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=375976</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH16077534</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL803067</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10504872</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">375976</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7050864</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7214770</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7302814</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7353953</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> |
| id | ZDB-4-EBA-ocn769342114 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:18:10Z |
| institution | BVB |
| isbn | 9781139101196 1139101196 9781139099875 1139099876 9781139101851 1139101854 9781139004114 1139004115 |
| language | English |
| oclc_num | 769342114 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (448 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | London Mathematical Society Lecture Note Series, 392. |
| series2 | London Mathematical Society Lecture Note Series, 392 ; |
| spelling | Chapman, Robin (Robin John) https://id.oclc.org/worldcat/entity/E39PCjtWq3Rm7X7GrXYpMHcqw3 http://id.loc.gov/authorities/names/no2012020236 Surveys in Combinatorics 2011. Cambridge : Cambridge University Press, 2011. 1 online resource (448 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier London Mathematical Society Lecture Note Series, 392 ; v. 392 Print version record. Cover; LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES; Title; Copyright; Contents; Preface; Counting planar maps, coloured or uncoloured; 1 Introduction; 2 Definitions and notation; 2.1 Planar maps; 2.2 Power series; 2.3 The Potts model and the Tutte polynomial; 3 Uncoloured planar maps: the recursive approach; 3.1 A functional equation for planar maps; 3.2 More functional equations; Maps with prescribed face degrees; Eulerian maps with prescribed face degrees; Other families of maps; 3.3 Equations with one catalytic variable and algebraicity theorems; Algebraicity results. Where is the quadratic method?4 Uncoloured planar maps: bijections; 4.1 Two proofs from The Book?; Four-valent maps and blossoming trees; A more general construction; Quadrangulations and labelled trees; 4.2 More bijections; 5 Coloured planar maps: the recursive approach; 5.1 A functional equation for coloured planar maps; 5.2 More functional equations; 5.3 A linear case: bipolar orientations of maps; 5.4 A quasi-linear case: spanning trees; 5.5 When q is a Beraha number: Algebraicity; 5.6 The general case: differential equations; Comments; 6 Some bijections for coloured planar maps. 6.1 Bipolar orientations of maps6.2 Spanning trees; 6.3 The Ising model (q = 2); 7 Final comments and questions; 7.1 Algebraicity; 7.2 Bijections; 7.3 Asymptotics of maps; Acknowledgements; References; A survey of PPAD-completeness for computing Nash equilibria; Acknowledgements; 1 Total Search Problems; 1.1 NP Total Search Problems; 1.2 Reducibility among total search problems; 1.3 PPAD, and some related concepts; 2 Sperner's lemma, and an associated computational problem; 3 Games and Nash Equilibria; 3.1 Some reductions among equilibrium problems; 3.2 The "in PPAD" result. 3.3 The Algebraic Properties of Nash Equilibria4 Brouwer functions, and discrete Brouwer functions; 4.1 Discrete Brouwer functions; 5 From Discrete Brouwer functions to Games; 5.1 Graphical Games; 5.2 From graphical to normal-form games; 6 Easy and hard classes of games; 6.1 Hard equilibrium computation problems; 6.2 Polynomial-time equilibrium computation problems; 7 The Complexity of Path-following Algorithms; 8 From Games to Markets; References; Hypergraph Turán problems; Acknowledgements; 1 Introduction; 2 Basic arguments; 3 Hypergraph Lagrangians; 4 Link graphs and multigraphs. 5 Stability6 Counting; 7 Flag algebras; 8 The remaining exact results; 9 Bounds for complete hypergraphs; 10 The infinitary perspective; 11 Algebraic methods; 12 Probabilistic methods; 13 Further topics; 13.1 Jumps; 13.2 Minimum degree problems; 13.3 Different host graphs; 13.4 Coloured Turán problems; 13.5 The speed of properties; 13.6 Local sparsity; 13.7 Counting subgraphs; 14 Summary of results; References; Some new results in extremal graph theory; Contents; 1 Introduction; 2 New results on classical extremal graph problems; 2.1 The extremal problems that are studied. 2.2 Erdos-Stone type problems. Survey articles based on the invited lectures given at the 23rd British Combinatorial Conference. Includes bibliographical references. Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Analyse combinatoire. MATHEMATICS Combinatorics. bisacsh Combinatorial analysis fast Graph theory fast Print version: Chapman, Robin. Surveys in Combinatorics 2011. Cambridge : Cambridge University Press, ©2011 9781107601093 London Mathematical Society Lecture Note Series, 392. FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=375976 Volltext |
| spellingShingle | Chapman, Robin (Robin John) Surveys in Combinatorics 2011. London Mathematical Society Lecture Note Series, 392. Cover; LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES; Title; Copyright; Contents; Preface; Counting planar maps, coloured or uncoloured; 1 Introduction; 2 Definitions and notation; 2.1 Planar maps; 2.2 Power series; 2.3 The Potts model and the Tutte polynomial; 3 Uncoloured planar maps: the recursive approach; 3.1 A functional equation for planar maps; 3.2 More functional equations; Maps with prescribed face degrees; Eulerian maps with prescribed face degrees; Other families of maps; 3.3 Equations with one catalytic variable and algebraicity theorems; Algebraicity results. Where is the quadratic method?4 Uncoloured planar maps: bijections; 4.1 Two proofs from The Book?; Four-valent maps and blossoming trees; A more general construction; Quadrangulations and labelled trees; 4.2 More bijections; 5 Coloured planar maps: the recursive approach; 5.1 A functional equation for coloured planar maps; 5.2 More functional equations; 5.3 A linear case: bipolar orientations of maps; 5.4 A quasi-linear case: spanning trees; 5.5 When q is a Beraha number: Algebraicity; 5.6 The general case: differential equations; Comments; 6 Some bijections for coloured planar maps. 6.1 Bipolar orientations of maps6.2 Spanning trees; 6.3 The Ising model (q = 2); 7 Final comments and questions; 7.1 Algebraicity; 7.2 Bijections; 7.3 Asymptotics of maps; Acknowledgements; References; A survey of PPAD-completeness for computing Nash equilibria; Acknowledgements; 1 Total Search Problems; 1.1 NP Total Search Problems; 1.2 Reducibility among total search problems; 1.3 PPAD, and some related concepts; 2 Sperner's lemma, and an associated computational problem; 3 Games and Nash Equilibria; 3.1 Some reductions among equilibrium problems; 3.2 The "in PPAD" result. 3.3 The Algebraic Properties of Nash Equilibria4 Brouwer functions, and discrete Brouwer functions; 4.1 Discrete Brouwer functions; 5 From Discrete Brouwer functions to Games; 5.1 Graphical Games; 5.2 From graphical to normal-form games; 6 Easy and hard classes of games; 6.1 Hard equilibrium computation problems; 6.2 Polynomial-time equilibrium computation problems; 7 The Complexity of Path-following Algorithms; 8 From Games to Markets; References; Hypergraph Turán problems; Acknowledgements; 1 Introduction; 2 Basic arguments; 3 Hypergraph Lagrangians; 4 Link graphs and multigraphs. 5 Stability6 Counting; 7 Flag algebras; 8 The remaining exact results; 9 Bounds for complete hypergraphs; 10 The infinitary perspective; 11 Algebraic methods; 12 Probabilistic methods; 13 Further topics; 13.1 Jumps; 13.2 Minimum degree problems; 13.3 Different host graphs; 13.4 Coloured Turán problems; 13.5 The speed of properties; 13.6 Local sparsity; 13.7 Counting subgraphs; 14 Summary of results; References; Some new results in extremal graph theory; Contents; 1 Introduction; 2 New results on classical extremal graph problems; 2.1 The extremal problems that are studied. Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Analyse combinatoire. MATHEMATICS Combinatorics. bisacsh Combinatorial analysis fast Graph theory fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85028802 http://id.loc.gov/authorities/subjects/sh85056471 |
| title | Surveys in Combinatorics 2011. |
| title_auth | Surveys in Combinatorics 2011. |
| title_exact_search | Surveys in Combinatorics 2011. |
| title_full | Surveys in Combinatorics 2011. |
| title_fullStr | Surveys in Combinatorics 2011. |
| title_full_unstemmed | Surveys in Combinatorics 2011. |
| title_short | Surveys in Combinatorics 2011. |
| title_sort | surveys in combinatorics 2011 |
| topic | Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Analyse combinatoire. MATHEMATICS Combinatorics. bisacsh Combinatorial analysis fast Graph theory fast |
| topic_facet | Combinatorial analysis. Graph theory. Analyse combinatoire. MATHEMATICS Combinatorics. Combinatorial analysis Graph theory |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=375976 |
| work_keys_str_mv | AT chapmanrobin surveysincombinatorics2011 |