Surveys in Combinatorics 1985
Invited Papers for the Tenth British Combinatorial Conference
Published on 25. July 1985
Book
Paperback/Softback
180 pages
978-0-521-31524-1 (ISBN)
Description
The British Combinatorial Conference is an established biennial international gathering. This volume contains the invited papers presented, by several distinguished mathematicians, at the 1985 conference. The papers cover a broad range of combinatorial topics, including cryptography, greedy algorithms, graph minors, flows through random networks, (0, 1)-distance problems, irregularities of point distributions and reconstruction of infinite graphs.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 10 mm
Weight
270 gr
ISBN-13
978-0-521-31524-1 (9780521315241)
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
Ian Anderson
Surveys in Combinatorics 1985
Invited Papers for the Tenth British Combinatorial Conference
E-Book
05/2013
1st Edition
Cambridge University Press
€27.99
Available for download
Content
Preface; 1. Combinatorics and Ramanujan's 'lost' notebook G. E. Andrews; 2. Irregularities of distribution and combinatorics J. Beck; 3. Adaptive algorithms for communications H. J. Beker; 4. Random flows: network flows and electrical flows through random media G. R. Grimmett; 5. On greedy algorithms that succeed A. J. Hoffman; 6. {0,1*} distance problems in combinatorics J. H. van Lint; 7. Detachments of graphs and generalised Euler trails C. St J. A. Nash-Williams; 8. Graph minors - a survey N. Robertson and P. D. Seymour; Index of names.