Surveys in Combinatorics 1985: Invited Papers for the Tenth British Combinatorial Conference

by Ian Anderson (Editor)

Overview

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.

Product Details

ISBN-13:	9780521315241
Publisher:	Cambridge University Press
Publication date:	07/25/1985
Series:	London Mathematical Society Lecture Note Series , #103
Pages:	180
Product dimensions:	5.98(w) x 8.98(h) x 0.39(d)

Table of Contents

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.