Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Online ordering will be unavailable from Saturday, September 6 at 06:00 GMT until Sunday, September 7 at 14:00 GMT.

To place an order, please contact Customer Services.

UK/ROW directcs@cambridge.org +44 (0) 1223 326050 | US customer_service@cambridge.org 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand enquiries@cambridge.edu.au 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Recommended product

Popular links

Popular links


Surveys in Combinatorics 1985

Surveys in Combinatorics 1985

Surveys in Combinatorics 1985

Invited Papers for the Tenth British Combinatorial Conference
Editor:
Ian Anderson
G. E. Andrews, J. Beck, H. J. Beker, G. R. Grimmett, A. J. Hoffman, J. H. van Lint, C. St J. A. Nash-Williams, N. Robertson, D. Seymour
Published:
September 1985
Format:
Paperback
ISBN:
9780521315241

Looking for an inspection copy?

Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book.

AUD$65.41
exc GST
Paperback
$50.00 USD
eBook

    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

    September 1985
    Paperback
    9780521315241
    180 pages
    228 × 152 × 10 mm
    0.21kg
    Available

    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.
      Contributors
    • G. E. Andrews, J. Beck, H. J. Beker, G. R. Grimmett, A. J. Hoffman, J. H. van Lint, C. St J. A. Nash-Williams, N. Robertson, D. Seymour

    • Editor
    • Ian Anderson