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.
Reihe
Sprache
Verlagsort
Zielgruppe
Dateigröße
ISBN-13
978-1-107-10800-4 (9781107108004)
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 Klassifikation
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.
