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

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Surveys in Combinatorics 1985

All titles
Surveys in Combinatorics 1985

Surveys in Combinatorics 1985

Invited Papers for the Tenth British Combinatorial Conference
Ian Anderson
July 1985
Paperback
9780521315241
$46.99
USD
Paperback
USD
eBook
    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.

    Product details

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

    Often bought together

    Surveys in Combinatorics, 1989
    Surveys in Combinatorics, 1989

    : Paperback

    Invited Papers at the Twelfth British Combinatorial Conference

    Often bought together

    This title is available for institutional purchase via Cambridge Core

    Learn more
    cambridge core banner

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    : Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    Theory and Practice of Logic Programming
    Theory and Practice of Logic Programming

    : Journal

    Theory and Practice of Logic Programming emphasises both the theory and practice of logic programming. Logic programming applies to all areas of artificial intelligence and computer science and is fundamental to all of them. Among the topics covered are AI applications that use logic programming, logic programming methodologies, specification, analysis and verification of systems, inductive logic programming, multi-relational data mining, natural language processing, knowledge representation, nonmonotonic reasoning, semantic web reasoning, databases, implementations and architectures and constraint logic programming.

    Journal of Functional Programming
    Journal of Functional Programming

    : Journal

    Journal of Functional Programming is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. Special tracks are devoted to tools and applications, commercial uses and education; pearl-type papers are encouraged. For more details see the Advice for Authors page..Manuscripts for consideration in the Journal of Functional Programming should be submitted electronically, via Scholar One ManuscriptsTM:  http://mc.manuscriptcentral.com/cup/jfp_submit. See Instructions for Contributors.

    Related Journals

    Also by this Author

    Contents

    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.
      • Show more

    Look inside

    Courses
    Resources
    Additional Information
    About the authors
      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

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services