
Surveys in Combinatorics, 1997
R. A. Bailey(Editor)
Cambridge University Press
Published on 31. July 1997
Book
Paperback/Softback
356 pages
978-0-521-59840-8 (ISBN)
Description
This volume contains the invited lectures given at the Sixteenth British Combinatorial Conference, held in July 1997 at Queen Mary and Westfield College, University of London. This biennial conference is a well-established international event, with speakers from all over the world. Contained here is a survey of some of the most important work ever in graph theory, with related papers that will be essential background reading to anyone doing research in this field. Also included is an illustration of how recent developments in group theory lead to advances in graph theory, and an exciting new construction of one of the Mathieu groups. Other articles show how to construct a block design, and how to use finite geometries. An account is given of the computational complexity of counting. 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.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 21 mm
Weight
578 gr
ISBN-13
978-0-521-59840-8 (9780521598408)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

R. A. Bailey
Surveys in Combinatorics, 1997
E-Book
03/2011
1st Edition
Cambridge University Press
€70.99
Available for download
Person
Content
1. Distinguishing symmetry groups J. Conway; 2. The harmonious chromatic number and achromatic number of graphs K. J. Edwards; 3. Computer construction of block designs C. W. H. Lam; 4. Finite quasiprimitive graphs C. E. Praeger; 5. Tree width and some variations B. Reed; 6. Minor-monotone graph parameters A. Schrijver; 7. Applications of algebraic curves in finite geometry T. Szonyi; 8. Finite partially ordered sets T. Trotter; 9. Approximate counting D. J. A. Welsh.