Surveys in combinatorics 2011
- edited by Robin Chapman.
- Cambridge : Cambridge University Press, 2011.
- Physical description
- vii, 437 p. : ill. ; 24 cm.
- London Mathematical Society lecture note series ; 392.
- Includes bibliographical references.
- 1. Counting planar maps, coloured or uncoloured / Mreille Bousquet-Mélou
- 2. A survey of PPAD-completeness for computing Nash equilibria / dr Paul W. Goldberg
- 3. Hypergraph Turán problems / Peter Keevash
- 4. Some new results in external graph theory / V. Nikiforov
- 5. The cyclic sieving phenomenon / Bruce Sagan
- 6. Order in building theory / Koen Thas
- 7. Graphs, colours, weights and hereditary properties / Andrew Thomason
- 8. Random geometric graphs / Mark Walters
- 9. Transversals in Latin squares / Ian Wanless.
- Publisher's Summary
- This volume contains nine survey articles based on the invited lectures given at the 23rd British Combinatorial Conference, held at Exeter in July 2011. This biennial conference is a well-established international event, with speakers from all over the world. By its nature, this volume provides an up-to-date overview of current research activity in several areas of combinatorics, including extremal graph theory, the cyclic sieving phenomenon and transversals in Latin squares. Each article is clearly written and assumes little prior knowledge on the part of the reader. The authors are some of the world's foremost researchers in their fields, and here they summarise existing results and give a unique preview of the most recent developments. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science and statistics.
(source: Nielsen Book Data)9781107601093 20160605
- Publication date
- London Mathematical Society lecture note series ; 392
- Papers presented at the 23rd British Combinatorial Conference, held at the University of Exeter, July 2011.
Browse related items
Start at call number: