|
|
|
|
LEADER |
00000cam a2200000Mu 4500 |
001 |
EBSCO_ocn769342114 |
003 |
OCoLC |
005 |
20231017213018.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
|
019 |
|
|
|a 767725221
|a 770097756
|a 818635143
|a 1170281072
|a 1170806321
|a 1264975509
|
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.)
|
029 |
1 |
|
|a AU@
|b 000057022701
|
029 |
1 |
|
|a DEBSZ
|b 372742785
|
029 |
1 |
|
|a DEBSZ
|b 379324369
|
035 |
|
|
|a (OCoLC)769342114
|z (OCoLC)767725221
|z (OCoLC)770097756
|z (OCoLC)818635143
|z (OCoLC)1170281072
|z (OCoLC)1170806321
|z (OCoLC)1264975509
|
050 |
|
4 |
|a QA164 .S887 2011
|
072 |
|
7 |
|a MAT
|x 036000
|2 bisacsh
|
082 |
0 |
4 |
|a 511.6
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Chapman, Robin
|q (Robin John)
|
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.
|
590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
650 |
|
0 |
|a Combinatorial analysis.
|
650 |
|
0 |
|a Graph theory.
|
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 |
|u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=375976
|z Texto completo
|
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 IZTAP
|