Surveys in Combinatorics 2021
£62.99
Part of London Mathematical Society Lecture Note Series
- Editors:
- Konrad K. Dabrowski, Durham University
- Maximilien Gadouleau, Durham University
- Nicholas Georgiou, Durham University
- Matthew Johnson, Durham University
- George B. Mertzios, Durham University
- Daniël Paulusma, Durham University
- Date Published: June 2021
- availability: In stock
- format: Paperback
- isbn: 9781009018883
£
62.99
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
This volume contains nine survey articles based on plenary lectures given at the 28th British Combinatorial Conference, hosted online by Durham University in July 2021. This biennial conference is a well-established international event, attracting speakers from around the world. Written by some of the foremost researchers in the field, these surveys provide up-to-date overviews of several areas of contemporary interest in combinatorics. Topics discussed include maximal subgroups of finite simple groups, Hasse–Weil type theorems and relevant classes of polynomial functions, the partition complex, the graph isomorphism problem, and Borel combinatorics. Representing a snapshot of current developments in combinatorics, this book will be of interest to researchers and graduate students in mathematics and theoretical computer science.
Read more- Includes nine survey articles by world-leading researchers
- Summarises recent developments on a variety of hot topics in combinatorics
- Broadly accessible to mathematicians and theoretical computer scientists
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: June 2021
- format: Paperback
- isbn: 9781009018883
- length: 378 pages
- dimensions: 228 x 152 x 21 mm
- weight: 0.56kg
- availability: In stock
Table of Contents
1. The partition complex: an invitation to combinatorial commutative algebra Karim Adiprasito and Geva Yashfe
2. Hasse-Weil type theorems and relevant classes of polynomial functions Daniele Bartoli
3. Decomposing the edges of a graph into simpler structures Marthe Bonamy
4. Generating graphs randomly Catherine Greenhill
5. Recent advances on the graph isomorphism problem Martin Grohe and Daniel Neuen
6. Extremal aspects of graph and hypergraph decomposition problems Stefan Glock, Daniela Kühn and Deryk Osthus
7. Borel combinatorics of locally finite graphs Oleg Pikhurko
8. Codes and designs in Johnson graphs with high symmetry Cheryl E. Praeger
9. Maximal subgroups of finite simple groups: classifications and applications Colva M. Roney-Dougal.
Related Books
related journals
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.
×