Skip to content
Register Sign in Wishlist

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

£23.99

Part of London Mathematical Society Lecture Note Series

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
View all contributors
  • Date Published: July 1985
  • availability: Available
  • format: Paperback
  • isbn: 9780521315241

£ 23.99
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: July 1985
    • format: Paperback
    • isbn: 9780521315241
    • length: 180 pages
    • dimensions: 228 x 152 x 10 mm
    • weight: 0.21kg
    • availability: 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.

  • Editor

    Ian Anderson

    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

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×