Surveys in combinatorics 2009
Author(s)
Bibliographic Information
Surveys in combinatorics 2009
(London Mathematical Society lecture note series, 365)
Cambridge University Press, 2009
- : pbk
Available at 44 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: pbkS||LMS||365200010707008
Note
"British Combinatorial Committee"--Cover
"The Twenty-Second British Combinatorial Conference was ... held in St Andrews in July 2009."--Pref
Includes bibliographical references
Description and Table of Contents
Description
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.
Table of Contents
- 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 Kuhn and Deryk Osthus
- 7. Counting planar graphs and related families of graphs Omer Gimenez and Marc Noy
- 8. Metrics for sparse graphs B. Bollobas and O. Riordan
- 9. Recent results on chromatic and flow roots of graphs and matroids G. F. Royle.
by "Nielsen BookData"