Surveys in Combinatorics 2017
Part of London Mathematical Society Lecture Note Series
- Editors:
- Anders Claesson, University of Iceland, Reykjavik
- Mark Dukes, University College Dublin
- Sergey Kitaev, University of Strathclyde
- David Manlove, University of Glasgow
- Kitty Meeks, University of Glasgow
- Date Published: June 2017
- availability: Available
- format: Paperback
- isbn: 9781108413138
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- Provides nine survey articles by world-leading researchers in combinatorics
- Summarises the current state of the field
- Accessible to non-experts
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×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: Available
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.
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» 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 ×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.
×