Surveys in combinatorics, 1985

Author(s)

Bibliographic Information

Surveys in combinatorics, 1985

edited by Ian Anderson

（London Mathematical Society lecture note series, 103）

Cambridge University Press, 1985

Available at  / 67 libraries

Search this Book/Journal

Note

"Eight of the nine invited lectures"--Pref

Invited papers for the Tenth British Combinatorial Conference

Includes bibliographies and index

Description and Table of Contents

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.

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.

by "Nielsen BookData"

Related Books： 1-1 of 1

Details

Page Top