Skip to content
Register Sign in Wishlist

Surveys in Combinatorics 2017

Part of London Mathematical Society Lecture Note Series

R. A. Bailey, Julia Böttcher, William Y. C. Chen, Antonio Cossidente, Daniel Horsley, Vít Jelínek, Robert Morris, Benny Sudakov, Julia Wolf
View all contributors
  • Date Published: June 2017
  • availability: Temporarily unavailable - available from TBC
  • format: Paperback
  • isbn: 9781108413138


Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • This volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Written by internationally recognised experts in the field, these articles represent a timely snapshot of the state of the art in the different areas of combinatorics. Topics covered include the robustness of graph properties, the spt-function of Andrews, switching techniques for edge decompositions of graphs, monotone cellular automata, and applications of relative entropy in additive combinatorics. The book will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.

    • Provides nine survey articles by world-leading researchers in combinatorics
    • Summarises the current state of the field
    • Accessible to non-experts
    Read more

    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: June 2017
    • format: Paperback
    • isbn: 9781108413138
    • length: 448 pages
    • dimensions: 227 x 153 x 25 mm
    • weight: 0.66kg
    • contains: 57 b/w illus. 4 tables
    • availability: Temporarily unavailable - available from TBC
  • Table of Contents

    1. Relations among partitions R. A. Bailey
    2. Large-scale structures in random graphs Julia Böttcher
    3. The spt-function of Andrews William Y. C. Chen
    4. Combinatorial structures in finite classical polar spaces Antonio Cossidente
    5. Switching techniques for edge decompositions of graphs Daniel Horsley
    6. Ramsey-type and amalgamation-type properties of permutations Vít Jelínek
    7. Monotone cellular automata Robert Morris
    8. Robustness of graph properties Benny Sudakov
    9. Some applications of relative entropy in additive combinatorics Julia Wolf.

  • Editors

    Anders Claesson, University of Iceland, Reykjavik
    Anders Claesson is a Professor of Mathematics at the University of Iceland, Reykjavik. He is a well-established researcher whose main research interests are in enumerative combinatorics, with a focus on permutation patterns.

    Mark Dukes, University College Dublin
    Mark Dukes is a Lecturer in Mathematics at University College Dublin and an Honorary Senior Lecturer at the University of Strathclyde. His research focuses on discrete and combinatorial mathematics, and their applications to complex systems.

    Sergey Kitaev, University of Strathclyde
    Sergey Kitaev is a Reader in Combinatorics and the Director of Research in the Department of Computer and Information Sciences at the University of Strathclyde. He is the author of numerous publications, including Patterns in Permutations and Words (2011) and Words and Graphs (2015). His research focuses on combinatorics and graph theory.

    David Manlove, University of Glasgow
    David Manlove is a Senior Lecturer in Computing Science at the University of Glasgow. He is interested in designing algorithms for problems involving matching agents to commodities (for example, junior doctors to hospitals, kidney patients to donors) in the presence of ordinal preferences or cardinal utilities. His publications include Algorithmics of Matching under Preferences (2013). He has collaborated with the National Health Service and is Vice-Chair of the ENCKEP COST Action (European Network for Collaboration on Kidney Exchange Programmes).

    Kitty Meeks, University of Glasgow
    Kitty Meeks is a Research Fellow in Computing Science at the University of Glasgow, where she currently holds a Royal Society of Edinburgh Personal Research Fellowship, funded by the Scottish Government. Her research focuses on the computational complexity of combinatorial problems, with a particular emphasis on parameterised complexity and the application of graph-theoretic methods to real-world problems.


    R. A. Bailey, Julia Böttcher, William Y. C. Chen, Antonio Cossidente, Daniel Horsley, Vít Jelínek, Robert Morris, Benny Sudakov, Julia Wolf

Related Books

Sorry, this resource is locked

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

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 Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

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.


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.