Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Surveys in Combinatorics 2013

$72.00 (C)

Part of London Mathematical Society Lecture Note Series

David Conlon, Jacob Fox, Massimo Giulietti, Tor Helleseth, Alexander Kholosha, Jan van den Heuvel, Jozef Širáň, Einar Steingrímsson, Kristina Vušković, Jim Geelen, Bert Gerards, Geoff Whittle, Shalosh B. Ekhad, Doron Zeilberger
View all contributors
  • Date Published: July 2013
  • availability: Available
  • format: Paperback
  • isbn: 9781107651951

$ 72.00 (C)
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This volume contains nine survey articles based on the invited lectures given at the 24th British Combinatorial Conference, held at Royal Holloway, University of London in July 2013. This biennial conference is a well-established international event, with speakers from around the world. The volume provides an up-to-date overview of current research in several areas of combinatorics, including graph theory, matroid theory and automatic counting, as well as connections to coding theory and Bent functions. Each article is clearly written and assumes little prior knowledge on the part of the reader. The authors are some of the world's foremost researchers in their fields, and here they summarise existing results and give a unique preview of cutting-edge developments. The book provides a valuable survey of the present state of knowledge in combinatorics, and will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.

    • The articles within present overviews of important recent developments in different areas of combinatorics
    • Most articles contain open problems which will be of interest to researchers in combinatorics and related areas
    • The articles are accessible to non-experts and do not assume extensive prior knowledge
    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: July 2013
    • format: Paperback
    • isbn: 9781107651951
    • length: 388 pages
    • dimensions: 229 x 152 x 22 mm
    • weight: 0.57kg
    • contains: 30 b/w illus. 2 tables
    • availability: Available
  • Table of Contents

    Preface
    1. Graph removal lemmas David Conlon and Jacob Fox
    2. The geometry of covering codes: small complete caps and saturating sets in Galois spaces Massimo Giulietti
    3. Bent functions and their connections to combinatorics Tor Helleseth and Alexander Kholosha
    4. The complexity of change Jan van den Heuvel
    5. How symmetric can maps on surfaces be? Jozef Širáň
    6. Some open problems on permutation patterns Einar Steingrímsson
    7. The world of hereditary graph classes viewed through Truemper configurations Kristina Vušković
    8. Structure in minor-closed classes of matroids Jim Geelen, Bert Gerards and Geoff Whittle
    9. Automatic counting of tilings of skinny plane regions Shalosh B. Ekhad and Doron Zeilberger.

  • Editors

    Simon R. Blackburn, Royal Holloway, University of London
    Simon R. Blackburn studied in Bristol and Oxford, following which he rose through the ranks at Royal Holloway, initially as a Research Assistant and EPSRC Advanced Fellow (working on various aspects of cryptography) and then as a Reader and Professor. He is a member of the BSHM, IACR, IEEE and LMS, an associate member of the AMS, and a Fellow of the ICA and IMA. His research involves combinatorics, cryptography, communication theory, algebra and the connections between them.

    Stefanie Gerke, Royal Holloway, University of London
    Stefanie Gerke studied at the FU Berlin and the University of Oxford before moving on to work at the TU Munich, the ETH Zurich and now Royal Holloway, University of London. She is a member of the DMV, LMS and HEA and has won several awards for her research and innovative teaching. She works mainly in probabilistic graph theory and algorithms.

    Mark Wildon, Royal Holloway, University of London
    Mark Wildon studied in Cambridge and Oxford, after which he worked in Oxford as a College Lecturer and Bristol as a Research Fellow, before joining Royal Holloway, University of London in 2010. He is a member of the AMS and LMS. He is the co-author of a highly praised textbook on Lie algebras and in 2012 was awarded a university prize for teaching excellence. His main research interests are combinatorics and representation theory, especially the representation theory of the symmetric group.

    Contributors

    David Conlon, Jacob Fox, Massimo Giulietti, Tor Helleseth, Alexander Kholosha, Jan van den Heuvel, Jozef Širáň, Einar Steingrímsson, Kristina Vušković, Jim Geelen, Bert Gerards, Geoff Whittle, Shalosh B. Ekhad, Doron Zeilberger

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

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.
×