Surveys in Combinatorics 2009 (eBook, PDF)

Redaktion: Huczynska, Sophie

• Format: PDF

Produktbeschreibung

This volume contains survey articles based on the invited lectures given at the Twenty-second British Combinatorial Conference, held in July 2009 at the University of St Andrews. 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 graph theory, design theory and packing problems. 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, statistics and engineering.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 9. Juli 2009
• Englisch
• ISBN-13: 9781107109292
• Artikelnr.: 39029050

Inhaltsangabe

Preface
1. Graph decompositions and symmetry Arrigo Bonisoli
2. Combinatorics of optimal designs R. A. Bailey and Peter J. Cameron
3. Regularity and the spectra of graphs W. H. Haemers
4. Trades and t-designs G. B. Khosrovshahi and B. Tayfeh-Rezaie
5. Extremal graph packing problems: Ore-type versus Dirac-type H. A. Kierstead, A. V. Kostochka, and G. Yu
6. Embedding large subgraphs into dense graphs Daniela Kühn and Deryk Osthus
7. Counting planar graphs and related families of graphs Omer Giménez and Marc Noy
8. Metrics for sparse graphs B. Bollobás and O. Riordan
9. Recent results on chromatic and flow roots of graphs and matroids G. F. Royle.